Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability
An ambiguous grammar is one which has :
A. More than one derivations
B. More than one left most derivations
C. More than one right most derivations
D. More than one Parse tree
E. More than one syntax tree
Choose the correct answer from the options given below:
1
A and D Only
2
B and C Only
3
D and E Only
4
A and E Only