For the parse tree, you can draw them in word or on paper and scan or photograph and insert into the word document. Make sure the images are clear enough to read.

1. Using the grammar below show a parse tree and a leftmost derivation for the following statement:

Grammar: -> =

-> A | B | C

-> +

| *

| ( )

|

Statement: A = A * (B + (C * A))

Answer (left most derivation):

Answer (parse tree)

2. Prove that the following grammar is ambiguous (Hint: Show the parse trees):

->

-> + |

-> a | b | c