$2.(14$ pts$)$ Let G $=($V$,\backslash$Sigma $,$ R$,$STMT$)$ be the following grammar:

$$STMT$->$ASSIGN$|$IF$|$IF$-$ELSE$$

$$IF$->$ if condition $$STMT$$

$$IF$-$ELSE$->$ if condition $$STMT$$ else $$STMT$$

$$ASSIGN$->$ a:$=1$

$\backslash$Sigma $=\{$if$,$condition,else,a:$=1\}$

V $=\{$STMT$,$IF$,$IF$-$ELSE$,$ASSIGN$\}$

$1$

G is a natural$-$looking grammar for a fragment of a programming language, but G is

ambiguous.

$($a$)$ Show that G is ambiguous.

$($b$)$ Give a new unambiguous grammar for the same language$\mathrm{.}2.(14$ pts$)$ Let G $=($V$,\backslash$Sigma $,$ R$,$STMT$)$ be the following grammar:

$$STMT$->$ASSIGN$|$IF$|$IF$-$ELSE$$

$$IF$->$ if condition $$STMT$$

$$IF$-$ELSE$->$ if condition $$STMT$$ else $$STMT$$

$$ASSIGN$->$ a:$=1$

$\backslash$Sigma $=\{$if$,$condition,else,a:$=1\}$

V $=\{$STMT$,$IF$,$IF$-$ELSE$,$ASSIGN$\}$

$1$

G is a natural$-$looking grammar for a fragment of a programming language, but G is

ambiguous.

$($a$)$ Show that G is ambiguous.

$($b$)$ Give a new unambiguous grammar for the same language.