CIT445 TMA

1. A containment hierarchy of classes of formal grammars is called
*The Chomsky hierarchy
2. All languages generated by a regular grammar can be recognised in linear time by a
*finite state machine
3. Strings generated by some formal grammar can be described as
*language
4. A set of rules of a specific kind, for forming strings in a formal language is called
*formal grammar
5. Two words can be combined together to form a new word by means of
*concatenation
6. Type-0 grammars are also known as
*unrestricted grammars
7. A grammar in which the left-hand side of each production rule consists of only a single non-terminal symbol is called
*context-free grammar
8.Well-formed words are usually words that belongs to
*formal language
9.__ is a set of sentences expressed in a formal language
*formal theory
10. A part of the compiler that constructs the desired target programme from the intermediate representation is called
*synthesis part