In ambiguous grammar, a single sentence can have multiple valid parse trees. This occurs because the grammar allows more than one valid syntactic structure for the same sequence of tokens.
Examples of Ambiguity:
In practice, parsers often use additional techniques or rules to disambiguate grammar. This may involve rewriting the grammar to remove ambiguity or using parser algorithms that can handle ambiguity in a controlled manner.