Homework 2

1. Chapter 3, problem 3
2. Chapter 3, problem 7c
3. Chapter 3, problem 11
4. Chapter 3, problem 16
5. Consider the language specified by the grammar

   S -> SS | (S) | ()
   

   1. Generate several valid sentences in this language.
   2. Find a sentence in this language that can be used to demonstrate that this language is ambiguous. Show the two different parse trees for this sentence.
   3. Find a grammar for this language that is unambiguous.
    

This assignment can be turned in

• on paper (in class the day they are due)
• emailed to me (please use the address tcole@onyx.boisestate.edu) with the assignment number in the subject and your name in the text of the assignment.
• submitted using

      submit tcole cs354 h2

Acceptable formats for electronically submitted assignments are text, OpenOffice or MicrosoftWord. I should be able to open your assignment with OpenOffice. Unless otherwise specified in the assignment, the entire assignment should be in a single document named hwnnn with an appropriate extension.