Consider an ambiguous grammar G and its disambiguated version D. Let the…
GATE · 2007 · IT
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
Attempted by 131 students.
Sign up free to check your answer
Sign up freeLoading lesson…