Beginner
Theory of Computation
Q29 / 100
What is Chomsky Normal Form (CNF)?
Correct! Well done.
Incorrect.
The correct answer is B) A CFG where productions are either A → BC or A → a (two non-terminals or one terminal)
B
Correct Answer
A CFG where productions are either A → BC or A → a (two non-terminals or one terminal)
Explanation
CNF productions are A → BC (two non-terminals) or A → a (one terminal). Every CFG can be converted to CNF. CNF is used by the CYK parsing algorithm.
Progress
29/100