6.5) Using the grammar 3.4, (the ambiguous grammar) create two parse trees for each of the following statements: note, we can only do this because the grammar is ambiguous - this actually proves the grammar is ambiguous a. A => C * B + A b. A => A + (B * C) c. A => (B * C) * A + B

Grammar 3.4 An Unambiguous Grammar for Expressions  =>  =   => A | B | C  =>  +  |   =>  *  |   => (  )|   => A|B|C