January 26, 2016:
Homework 1 Answers
January 31, 2016 an additional parsing problem for LR parsing.
Consider the following grammar:
You cn think of L as an l-value and R as an R-value.
Note: it is tedious to build this LR(1) parser -- but you must be sure that you do not mistake states as being equivalent if they contain the same items but with different lookahead sets. This observation is what makes this parser somewhat large.
March 13, 2016: Note on page 1 of this answer there is a typo in that the term LL(1) is used instead of SLR(1) which is clearly what was in the question adn what is shown in the answer. My bad.
March 2, 2016
Note: the quasi-Prolog definition of app has been corrected in HW2. The Scheme definition of app was always correct.
March 22, 2016
Homework 3 - Scheme practice.
Membership in a list
Count of all numbers in a list (with possible nesting)
April 10, 2016
Homework 4 - static and dynamic scope, virtual function resolution with type-based algorithms, points-to analysis
Correction to Virtual Function resolution answer (5/6/16)
April 25, 2016
Homework 5 - Lambda calculus and overloaded virtual methods
last changed at 11:05am May 6,2016 BGR.