CSC 456/656 Assignment 5

Due date, September 24, 2002, 4:00 PM.

All assignments must be handwritten (not typed or printed from a computer file) in your own handwriting, on 8.5 by 11 inch paper. Write your name on each sheet, and do not fold the pages or crimp the corners. Turn the pages in to me or to the graduate assistant on the due date.

  1. Work Exercise 5.1.7(d) on page 180 of your textbook. Here is a clue.
  2. Work Exercise 5.4.7(a,b) on page 215 of your textbook.
  3. This grammar for L, a certain simple language of expressions.
    Give an unambiguous context-free grammar for L, such that, if T is the parse tree for a string w in L, every subexpression of w is parsed by a subtree of T, using the usual precedences of operators. (That is, multiplication has higher precedence than addition or subtraction, and all operators follow a left-first rule in evaluation.)

Back to Course Page