Let L={a*b" | n2} Show that L is context-free for all k> 1 - Can the following grammar generate the string aabbabba If "yes", then generate a derivation tree for the string if "no", justify and explain S aaB A > bBb|A B > Aa

The following given grammar is a left recursive grammar S Sbab balb The language generated by this grammar is of the following form: L= { ba(bab), b(bab)" | m,ne N} This left recursive grammar can be transformed to a right recursive grammar as follows: S → T -> This right recursive grammar is an LL( ) grammar.

For the following grammar, write next to each production all of the set constraints you can deduce from it. Omit tautologies. S' - S$ S- AB A→ a Ab В — ЬВа В — л

Let G be the context-free grammar below. Use the brute force parsing algorithm studied in class to prove that w = aab does not belong to L(G). Do not use other methods. Show all work in all rounds needed. Label the rounds. [Hint: The number of rounds aS | BS | a; B ->bB | b