A grammar with more than one parse tree is called:
A grammar with more than one parse tree is called: Correct Answer Ambiguous
A context free grammar G is ambiguous if there is at least one string in L(G) having two or more distinct derivation trees or equivalently, two or more distinct leftmost derivations.
মোঃ আরিফুল ইসলাম
Feb 20, 2025