CSU390 03F: Homework 04

Assigned: Wed 08 Oct 2003
Due: Wed 15 Oct 2003

General Instructions

1. Please review the grading policy outlined in the course information page.

2. On the first page of each part of your solution write-up, you must make explicit which problems are to be graded for "regular credit", which problems are to be graded for "extra credit", and which problems you did not attempt. Please use a table something like the following

   Problem	01	02	03	04	05	06	07	08	09	...
   Credit	RC	RC	RC	EC	RC	RC	NA	RC	RC	...

   where "RC" is "regular credit", "EC" is "extra credit", and "NA" is "not applicable" (not attempted). Failure to do so will result in an arbitrary set of problems being graded for regular credit, no problems being graded for extra credit, and a five percent penalty assessment.

3. You must also write down with whom you worked on the assignment. If this changes from problem to problem, then you should write down this information separately with each problem.

Problems

Required: 5 of the following 7 problems
Points: 20 pts per problem

1. Exercise 2.4 (a,b)

2. Exercise 2.4 (c,d)

3. • Exercise 2.4 (f)
   • Exercise 2.6 (c)

4. Give finite state diagrams for PDAs which accept the languages described in Exercises 2.4 (f) and 2.6 (c)

5. • Exercise 2.8
   • Exercise 2.21 (a). Hint: The ambiguity present in the grammar shown in Exercise 2.21 is due to the if-then and if-then-else statements. The ambiguity you will discover is referred to as the "dangling else" ambiguity.

6. Construct CFGs for the following languages.
   • {w # w^R # | w in {0,1}^*}
   • {aⁱ b^j | i <= j <= 2i}

7. • Excercise 2.9
   • Construct a CFG for the following language.

     {a^m bⁿ | m > n >= 0}

Switch to:

• Homework 03
• Homework 05