Question
What is meant by CFG simplification in Theory of Automata and Formal Languages?
Correct Answer: A
removing useless, unreachable, or non-generating symbols and unnecessary productions
The correct answer is removing useless, unreachable, or non-generating symbols and unnecessary productions.
The correct answer is removing useless, unreachable, or non-generating symbols and unnecessary productions.
Leave a Reply