1.

If grammar G is unambiguous, G’ produced after the removal of Unit production will be:(a) ambiguous(b) unambiguous(c) finite(d) cannot be saidThis question was posed to me in an international level competition.The origin of the question is Eliminating Unit Productions in portion Properties of Context Free Languages of Automata Theory

Answer»

Right answer is (b) unambiguous

To explain I would say: With the simplification of CONTEXT free GRAMMARS, undesirable properties are INTRODUCED. It SAYS, if grammar G, before simplification is unambiguous, after simplification will ALSO be unambiguous.



Discussion

No Comment Found

Related InterviewSolutions