Beginner
Theory of Computation
Q28 / 100
What is Greibach Normal Form (GNF)?
Correct! Well done.
Incorrect.
The correct answer is B) A CFG where every production starts with a terminal followed by non-terminals
B
Correct Answer
A CFG where every production starts with a terminal followed by non-terminals
Explanation
GNF: every production is A → aB₁B₂...Bk where a is terminal and Bi are non-terminals. Any CFG can be converted to GNF. Useful for PDA construction.
Progress
28/100