Assignment #4 1. Find a context-free grammar for language 2. Consider the grammar with productions B Aa Decide whether the string aabbabba is in the language generated by this grammar SA context free grammar G-(V.T.S,P) is said to be a simple grammar or s-grammar if all its productions are of the form A, ar where A EV, ???, xepw, and any pair (A,a) occurs at most once in P Find an s-grammar for L-a"b", nd) 4. Show that the following grammar G is am biguous 5. Remove all unit-productions, all useless productions, and all ?-productions from the grammar AaaA AB 6. Convert the grammar Aaabl B--bbA into Chomsky normal form