1.

A context free language is called ambiguous if?

A. It has 2 or more than 2 left derivations for some terminal string L (G)
B. It has 2 or more than 2 right derivations for some terminal string L (G)
C. It has 2 or more than 2 left and right derivations for some terminal string L (G)
D. None of the mentioned
Answer» D. None of the mentioned


Discussion

No Comment Found