Question

Ambiguous grammer must have more than one parse tree for a string?

Answer 1

Ambiguous grammar. In computer science, an ambiguous grammar is a context-free grammar for which there exists a string that can have more than one leftmost derivation or parse tree, while an unambiguous grammar is a context-free grammar for which every valid string has a unique leftmost derivation or parse tree.

I hope this will help you

If not then comment me