Let G = (V, , R, ) be the following grammar.

< ASSIGN> | |

if condition then

if condition then else

a:=1

= {if, condition, then, else, a:=1}

V = { ,< IF-THEN>, , }

Show that G is ambiguous.

(To show G is ambiguous, you need to find a string which can be derived in G using two different parsing trees.)