Chapter 2 Homework

Instructions

Do the following problems from Exercises 2.0.4 on pp. 37-38 in your textbook:

1. #4 (5 pts)

2. #7 (5 points)

3. #9 part a. Do this two ways:
   • Construct an NFA using the technique we discussed in class. (5 points)
   • Construct a DFA using any technique you wish. (5 points)

4. (10 pts) Using the pseudocode style from class, define parsing routines for a recursive descent parser for the following grammar. In the grammar, nonterminals are in lowercase; terminals are in ALL CAPS or are quoted.

    e       -> '(' l ')'
            |  l
    l       -> A ',' e
            |  e
   

Submission

You may turn in a neatly handwritten or word processed paper. See the syllabus for additional information about homework exercises.