6. Using the grammar in Example 3.2, show a parse tree and a leftmost der ivation for each of the following statements: a. A = A * (B + (C * A)) EXAMPLE 3.2 A Grammar for Simple Assignment Statements - ABIC + | 1 cexpr>) | The grammar of Example 3.2 describes assignment statements whose right sides are arithmetic expressions with multiplication and addition operators and parentheses. For example, the statement A + B + A + CD is generated by the leftmost derivation: -> - => A = => A = cid> => A-B* => A-B* () => A - B + ( + ) => A-B* (A + ) => A - B (A ) => A - B (AC) #8. (2 points) Prove that the following grammar is ambiguous: + |