CS321 Languages and Compiler Design I Winter 2012

Instructor: Andrew Tolmach

Teaching Assistant: Brian Ledger

Office hours (in Linux lab FAB 88-10): Monday 10-noon; Thursday 4-??.

Course Information

Syllabus (pdf)
Mailing list

Required Readings

Check here for an up-to-date list of errata for the 2nd. edition of Engineering a Compiler.
And here is a similar list for the 1st. edition.

Suggested Exercises

Problems from Engineering a Compiler. Numbers of exercises are given in the form first-edition-number [second-edition-number]. Solutions (numbered as in the first edition) are available here using the user name "cs321" and the password given in class. Please do not copy the solution file or make any part of it visible on the open web.

1.1 [1.1], 1.3 [1.3].
2.2.1 [2.1], 2.2.2 [2.2], 2.3.1c [2.4c], 2.3.2 [2.5], 2.3.3b [2.6b], 2.4.1ab [2.7ab], 2.4.5a [2.9a], 2.5.1b [2.12b].
3.2.1 [3.1], 3.2.3 [3.3], 3.3.1 [3.4] (sample solution is misleading: see here for more details); 3.3.2 [3.5] (sample solution is wrong; here is a better one), 3.3.4 [3.7].
3.6.1 [3.13].
4.3.1 [4.3], 4.3.2 [4.4], 4.3.3 [4.5], 4.3.4 [4.6], 4.4.1a [4.7a], 4.4.3ab [4.9ab], 4.5.1 [4.10].
Some additional problems on lexical analysis, grammars and top-down parsing with sample solutions. These are also password-protected; again, please do not make them visible on the web.
Some more additional problems on bottom-up parsing, attribute grammars and type-checking with sample solutions. These are also password-protected; again, please do not make them visible on the web.

Exams

Lecture Notes and Supporting Code

Introduction 1/10/12 (pdf) (4up pdf)
Java 1/12/12 (pdf) (4up pdf)
Compiling a simple language 1/17-19/12. (No on-line lecture notes.)
Lexical Analysis; Regular Expressions 1/24/12 (pdf) (4up pdf)
Finite automata; Scanner generation 1/26/12 (pdf) (4up pdf)
Parsing; Context-free Grammars 1/31/12 (pdf) (4up pdf)
Top-down Parsing 2/2/12 (pdf) (4up pdf)
Predictive Parsing and LL(1) Grammars 2/7/10 (pdf) (4up pdf)
Bottom-up Parsing 2/16/12 (pdf) (4up pdf)
Parser Generators 2/16-21/12 (pdf) (4up pdf)
Types 2/23-28/12 (pdf) (4up pdf)
Type checking and equivalence 3/1/12-3/8/12 (pdf) (4up pdf)
Structural subtyping 3/8/12 (pdf)(4up pdf)
Polymorphism; Abstract Data Types 3/13/12 (pdf) (4up pdf)

fab Language

Reference Manual (pdf) [corrected 3/13/12 9:30pm]
Sample Programs
Additional Test Programs contributed by the class.

Homework Assignments

All homeworks (from #1 onwards) should be submitted by email to cs321-03@cecs.pdx.edu. Put "[hwn]", where n is the homework number, as the subject. Your submission file(s) should be attached to your mail message; if you submit multiple files be sure to zip them together first. Be sure to include your name in a comment inside your code files.

Homework 0 (attempt by 1/17/12; don't hand in) (pdf)
- sample solution 1
- sample solution 2
Homework 1 (due 1/31/12) (pdf)
Homework 2 (due 2/9/12) (pdf)
- LexerDriver.java
- ParseError.java
- Symbol.java
- Yylex.class (contains a working solution)
- JFlex home page
- If you're trying to install JFLex on windows, you may find this page useful.
- JFlex specification file for E language from Homework 1. The output of JFlex on this file should be a file Yylex.java containing class Lexer that is cut-and-paste-compatible with the one in hw1.java. This is just here to give you a complete example of a working JFlex specification, in a slightly different context.
Homework 3 (due 3/1/12) (pdf)
- ParserDriver.java
- Scanner.java
- Ast.java
- Symbol.java for use with CUP (different from HW2!)
- ParseError.java (same as in HW2)
- Yylex.class (reference solution for HW2)
- To run my reference parser, you'll need all of these:
  - Parser.class (result of compiling Parser.java) [corrected 2/29/12 7:40am]
  - CUP$Parser$actions.class (second result of compiling Parser.java) [corrected 3/29/12 7:40am]
  - SymKinds.class (result of compiling SymKinds.java, which is produced as side-effect of running CUP; used by Symbol.java)
- fab0.cup Framework for CUP specification for fab: use this as the starting point for your CUP-based parser. It works on a small subset of fab, such as this example. Note that running this file through CUP will produce warning messages, but these are harmless.
- CUP home page
- fab grammar [corrected 2/29/12 7am]
Homework 4 (due 3/15/12) (pdf)
- WorkingChecker.jar [corrected 3/10/12 3:30pm] contains the reference implementation of the checker. To build it, download this file and all the supporting files below, and execute
  javac -classpath .:WorkingChecker.jar:java-cup-11a.jar CheckDriver.java ParseError.java Symbol.java Scanner.java
  To run it on file foo.fab, execute
  java -classpath .:WorkingChecker.jar:java-cup-11a.jar CheckDriver < foo.fab
- Ast0.java contains the skeleton implementation of the checker. To build it, download this file and all the suporting files below, and execute
  javac -classpath .:java-cup-11a.jar Ast0.java CheckDriver.java ParseError.java Symbol.java Scanner.java
  To run it on file foo.fab, execute
  java -classpath .:java-cup-11a.jar CheckDriver < foo.fab
- Supporting files (for both versions of checker). With the exception of the driver, these are unchanged from previous assignments.

Java Resources

Language Reference
User Manuals (for version 1.7)
- Documentation for Oracle/Sun's Java tools is here.
- The standard Java library (API) is documented here.
Implementations
- A free implementation for linux or Windows is available from here
IDEs
- The eclipse IDE for Java Developers is freely available for download on linux, Mac OS, and Windows. Here is a very useful tutorial on getting started with using eclipse for homework 1. And here is a second tutorial on using eclipse to refactor and extend the hw1.java file.