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

ABC

$->)$

Using the grammar in Example, show a parse tree and a leftmost derivation for each of the following statements:

a$.$ A$=($A$+$B$)*$ C

d$.$ A$=$B $*($C $*($A$+$B$))$