Unformatted text preview: . Give a verbal description of the langauge generated by the above grammar. 3. [5.1 Problem 26] ±ind a linear grammar for the language L = { a n b m : n 6 = m } . 4. [5.2 Problem 3] ±ind an sgrammar for L = { a n b n +1 : n > = 2 } . 5. [5.2 Problem 7] Construct an unambiguous grammar equivalent to the grammar: S → AB  aaB , A → a  Aa , B → b . 6. [5.2 Problem 13] Show that the following grammar is ambiguous. S → aSbS  bSaS  λ . 7. [5.2 Problem 18] Show that the grammar S → aAb  λ A → aAb  λ is unambiguous. 1...
View
Full Document
 Fall '08
 Staff
 Formal language, Contextfree grammar, unambiguous grammar equivalent, bm ck

Click to edit the document details