University of Nevada Las Vegas
Howard R. Hughes
College of Engineering
Department of Computer Science
My Home Page

CSC 456/656 Assignment 4
Due date: Tuesday, October 1, 2013, 1: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, or on A4 paper.
Write your name on each sheet, and do not fold the pages or crimp the corners.
(You may use a paper clip or a staple.)
Turn the pages in to me or to the graduate assistant on or before the due date.
-
Work
Exercise 2.1 on page 154 of the third edition.
Exercise 2.1 on page 128 of the second edition.
Exercise 2.1 on page 119 of the first edition.
-
Work
Exercise 2.3 on page 155 of the third edition.
Exercise 2.3 on page 128 of the second edition.
Exercise 2.3 on page 120 of the first edition.
-
Work
Exercise 2.4 parts (b), (c), and (e) on page 155 of the third edition.
Exercise 2.4 parts (b), (c), and (e) on page 128 of the second edition.
Exercise 2.4 parts (b), (c), and (f)
on page 120 of the first edition.
-
Work Exercise 2.6(b) on page 155 of the third edition.
Exercise 2.6(b) on page 129 of the second edition.
Exercise 2.6(b) on page 120 of the first edition.
-
The following question is related to the ``dangling else" problem in
structured progamming.
Let Σ = {a,e,i} and let G be the context-free grammar whose
start symbol is S, and whose productions are as follows:
-
S → a
-
S → iS
-
S → iSeS
Prove that G is ambiguous by giving two different leftmost derivations
for the same string.
-
Give a Chomsky Normal Form grammar for the language generated
by the grammar given in problem 5.

Back to
Course Page