www.bbcnoun.com.ng CIT316 10/10 1. Strings generated by some formal grammar can be described as_____ language 2. A grammar where left-hand side of each production rule consists of only a single non-terminal symbol is called ____ context-free grammar 3. A containment hierarchy of classes of formal grammars is called___ The Chomsky hierarchy 4. All languages generated by a regular grammar can be recognized in linear time by a_____ finite state machine 5. A set of rules of a specific kind for froming strings in a final language is called____ formal grammar 6. Well-formed words are usually words that belongs to ____ formal language 7. ____ is a set of sentence expression in a formal language formal theory 8. Type-0 grammars are also known as ___ unrestricted grammars 9. A part of compiler that constructs the desired target program from the intermediate representation is called____ synthesis part 10. Two words can be combined together to form a new word by means of _____ concatenation