#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language

A grammar G is ambiguous if there is a word w Î L(G) having are least two different parse trees.

Answer

TRUE