Prove that the following grammar is ambiguous [closed]

Question

Closed. This question needs details or clarity. It is not currently accepting answers.

---

Want to improve this question? Add details and clarify the problem by editing this post.

Closed 9 years ago.

Improve this question

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

Answer 1

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.