Match the columns.

Match List – I with List – II:

Choose the correct answer from the options given below:

Correct option is A

Correct Answer:
(c) A → III, B → I, C → II, D → IV


5. The classification of grammars is based on the form of their production rules and the constraints they satisfy.
6. This matching directly aligns the production rules with their respective grammar types based on the definitions of CNF, GNF, CSG and S – Grammar.
Additional Knowledge:
· Chomsky Normal Form (CNF): It simplifies the structure of grammars and is often used for parsing algorithms in computational theory.
· Greibach Normal Form (GNF): GNF helps in simplifying pushdown automata design.
· Context-Sensitive Grammar (CSG): These are more powerful than context-free grammars and can define languages requiring memory.
· S - Grammar: This is a specialized type of grammar used for particular string manipulations in language theory.