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

-> =

-> A l B l C

-> +

l

-> *

l

-> ( )

l

1.1) A = (A + B) * C

Leftmost derivation:

Parse Tree:

1.2) A = B + C + A

Leftmost derivation:

Parse Tree: