This preview shows page 1. Sign up to view the full content.
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
This note was uploaded on 12/04/2010 for the course CS 321 taught by Professor Staff during the Fall '08 term at Oregon State.
 Fall '08
 Staff

Click to edit the document details