Book Name is : Elements of Theory of Computation 2nd edition Lewis. If you cannot do from this algorithm then you can do in your way and I will try figure it out.

1. Using the algorithm discussed in class, show that the transition diagram for a pushdown automaton to recognize the language generated by these grammar rules. Specify rest of PDA fully. (8) S>UTA A > aa b) Describe in English what language the grammar generates. (2) c) Give an example showing that the grammar above is ambiguous. Explain. Then provide a non ambiguous grammar (rules only) for the language (6)