How many parse tree can be constructed for the given ambiguous grammar?

Question

E--> E+E

E--> E*E

E--> id

Input string: id + id + id

Answer 1

For the string “ id + id + id” is generated by this grammar then there will be 2 parse tree

e.g. 1: 

For the string "3 * 2 + 5",

For the string "3 * 2 + 5", the above grammar can generate two parse trees

Since there are two parse trees for a single string "3 * 2 + 5", the grammar G is ambiguous.

Total 2  parse trees for a single string "3 * 2 + 5”

 

e.g. 2: For the string " id * id + id * id", there will be more than two parse tree

So, by grammar, we can only conclude whether it is ambiguous.

and there should be a string given for the number of parse trees generated.

Answer 2

There will be 2 parser tree one by replacing left most variable with I'd and another by replacing rightmost variable by id

Answer 3

For the given input string id+id+id

There is only two possible parse tree

And for the string id*id+id 

​​​​​​There will be more than one

​​​