Search code examples
ambiguous

Prove that the following grammar is ambiguous

S-> A|B|AB

A-> aA, B-> bB, A->€, B->€

€ is the empty string.

Find a string and show that it has two

a-) parse trees b-) leftmost derivations c-) rightmost derivations

Solution

  • We're not gonna do your homework.

    Build the parse tree using leftmost and rightmost derivations. If you can find any ambiguity, it is ambigious.

    S-> A|B|AB is the key part. Try using both A, B and AB.