Please watch the assignment instruction video before working on the assignment. You can write your assignment by hand on paper and then scan it$,$ or just prepare your assignment as a Word document.

$(20$ points$)$ Do problem $7($a$)($d$)$ on page $157.($Please see the Word document below if you have a different version of the textbook.$)$

Note that you need to build a parse tree AND do a leftmost derivation for each one of the two statements.

$2.(10$ points$)$ The following is a BNF description of the $\frac{C}{C}++$ pointer and array declarations:

${?}^{**}-$ int $\frac{?}{?}$ char

${?}^{**}$

$1$ Declarators $[$ number$]$

I name

Prove that this grammar $is$ ambiguous.

Hint: Find a sentence that can $be$ generated using two different parse trees. Write down the sentence and then draw the two trees that generate this sentence.

Hint: Find a sentence that can be generated using two different parse trees. Write down the sentence and then draw the two trees that generate this sentence.

$3.(10$ points$)$ Do problem $12$ on page $158.($Please see the Word document below if you have a different version of the textbook.$]$

Nate: $is$ the start symbol $in$ this grammar.

EXAMPLE $3\mathrm{.}4$ An Unambiguous Grammar for Expressions

cassign $>1$

Using the grammar in Example $3\mathrm{.}4,$ show a parse tree and a leflmost dervation for each of the following statements

$($a$)A=\{A+B\}+c$

b$.2-B+C+A$

c$.=-=(B+C)$

$($d$)A=3=(c+(A+B)]$

Consider the following grammar:

$\frac{?}{{?}_S}>ac|1,b\frac{?}{{?}_A}|$

$>c|C\frac{?}{{?}_B}|$

$>d||$