Intermediate
Theory of Computation
Q77 / 100
What technique converts a CFG into Chomsky Normal Form, and why is it useful?
Correct! Well done.
Incorrect.
The correct answer is B) Eliminating ε-productions, unit productions, and useless symbols, then breaking long right-hand sides into binary productions — this regular structure enables efficient algorithms like CYK
B
Correct Answer
Eliminating ε-productions, unit productions, and useless symbols, then breaking long right-hand sides into binary productions — this regular structure enables efficient algorithms like CYK
Explanation
CNF conversion proceeds in stages — removing ε- and unit-productions, eliminating unreachable/non-generating symbols, then restructuring rules into A → BC or A → a form. This uniform binary structure is exactly what the CYK parsing algorithm requires.
Progress
77/100