GATE | Gate IT 2007 | Question 9

Consider an ambiguous grammar G and its disambiguated version D. Let the language recognized by the two grammars be denoted by L(G) and L(D) respectively. Which one of the following is true ?
(A) L (D) ⊂ L (G)
(B) L (D) ⊃ L (G)
(C) L (D) = L (G)
(D) L (D) is empty


Answer: (C)

Explanation: By changing grammar, language will not change here. {as converting NFA to DFA language will not be changed}

Quiz of this Question

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.