198:515 Programming Languages and Compilers I
Problem Set 8
This homework will not be graded. A sample solution will be
made available at a later time.
Problem 1  Dependence Analysis
Give the direction vectors, and if possible the distance vectors for al
198:515 Programming Languages and Compilers I
Problem Set 7
This homework will not be graded. A sample solution will be
made available at a later time.
Problem 1  Unication in Prolog
Unify (if possible) the following Prolog lists and report any variable
198:515 Programming Languages and Compilers I
Problem Set 5
This homework will not be graded. A sample solution will be
made available at a later time.
Problem 1  normal form
Using CRI as discussed in class (see lecture 6, page 6), prove that if a norma
198:515 Programming Languages and Compilers I
Problem Set 6
This homework will not be graded. A sample solution will be
made available at a later time.
Problem 1  let and let* in TINY
1. How can the let and let* constructs be expressed in the TINY langua
CS 515 Programming Languages and Compilers I
Problem Set 1
Sample Solution
1
Problem Regular Expressions and Finite State
Machines
1. You want to dene identiers in a new programming language using a regular expression. An identiers in your programming lan
CS 515 Programming Languages and Compilers I
Problem Set 1
This homework will not be graded. A sample solution will be
made available at a later time.
1
Problem Regular Expressions and Finite State
Machines
1. You want to dene identiers in a new programmi
CS 515 Programming Languages and Compilers I
Problem Set 2
This homework will not be graded. A sample solution will be
made available at a later time.
Problem 1 Predictive Parsing
Assume the following CFG for predicate logic prex expressions.
Start := Exp
198:515 Programming Languages and Compilers I
Problem Set 4
This homework will not be graded. A sample solution will be
made available at a later time.
Problem 1  term abbreviations
Give the fully expanded terms for the following term abbreviations as
198:515 Programming Languages and Compilers I
Problem Set 3
This homework will not be graded. A sample solution will be
made available at a later time.
Problem 1
1
2
3
4
5
6
goal
expr
:=
:=

term :=

factor :=
expr
term AND expr
term
factor OR term
fact