1.) Consider the following grammar in which A, B, and S are nonterminal symbols, S is the starting symbol, a and b are terminal symbols.

S A | SB A Aa | aa | Aab | aB | bb

B aac | ac

a.) Show a rightmost derivation for aacab.

b.) Using the procedure explained on page 181 and transform the grammar into an equivalent non-left recursive grammar.

c.) Show a rightmost derivation for aacab, again, using the new rules created in step b.