Hi friend(computer science) if any one can help me with this?

E = AB
A = a|bc
B = ab|c

Is above grammar ambiguous? If yes, how?
Thanks

---

The grammar is ambiguous because.....

you can write the same thing in more than one ways....for example:

AA is the same as BB

Sorry for the late late late late reply!!!

The above Context Free Grammar is ambiguous because there are different parse trees for the same terminal string .

E = AB
A = a|bc
B = ab|c

E could generate the following parse trees

E= aab
E=ac
E=bcba
E=bcc