Syllabus and general information for MCS-388: Compiler Design (Spring 2002)


MCS-388 attempts to draw together the theory and practice of compiler construction. Much of the material will have a strong theoretical foundation. However, with the exception of the last couple topics (due to time constraints), this material will serve as the basis for compiler-writing projects. Topics include lexical and syntactic analysis, naive code generation, data-flow analysis, register allocation and assignment, suppression of partial redundancies, and instruction scheduling.

Office hours

I will be available in my office (OHS 303) 11:30-12:20 Tuesdays, 1:30-2:20 Wednesdays, 2:30-3:20 Thursdays, 1:30-2:20 Fridays, and by appointment. Or try your luck: just stop by and see whether my door is open. You may send me electronic mail at or call me at extension 7466. I'll try to put any updates to my office hours on my web page, so check there if in doubt.

World Wide Web

All course materials will be available through my World Wide Web page. The URL for this course is After this syllabus I will give hardcopy handouts only to those students who want them.


MCS-388 draws heavily on MCS-265, MCS-287, and MCS-284. Some notions from MCS-375 and MCS-236 also crop up. You're expected to be able to program. Since the compiler-building tools and pre-existing code modules I supply will be centered around the Java programming language, the path of least resistance will probably be to learn that language as we go if you don't already know it. On the other hand, there are comparable compiler-building tools centered around other languages, so if you would rather use another language, that's fine too, you'll just have a little less of a support network. I'll gladly accept labs written in any programming language: C++, Scheme, ML, Ada, you name it.

Text and readings

Our primary text will be the "dragon book," i.e., Compilers: Principles Techniques and Tools by Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman, Addison Wesley, 1986. We will also use some additional material: documentation, some of which will be on-line or in the lab area and some of which I'll hand out, and supplementary readings, which I will hand out. (There's also an on-line Java Tutorial at, and copies of a couple Java books in the MCS Lab monitors' room, any of which you are welcome to use as a supplement.)


Some days, shown in the syllabus, we will meet in the OHS 326 computer lab rather than in the usual classroom. Each lab has two to four lab days set aside for us to work together, but will also require you to spend additional time out of class.

Attendance is mandatory for all lab sessions, unless you have already turned in your lab report. I will excuse up to two absences per student, for any reason. Use yours wisely. If you exceed this allowance, I may reduce your course grade by one letter grade.


Students are encouraged to discuss the course, including issues raised by the assignments. However, the solutions to assignments should be individual original work unless otherwise specified. If an assignment makes you realize you don't understand the material, ask a fellow student a question designed to improve your understanding, not one designed to get the assignment done. To do otherwise is to cheat yourself out of understanding, as well as to be intolerably dishonorable.

Any substantive contribution to your solution by another person or taken from a publication should be properly acknowledged in writing. Failure to do so is plagiarism and will necessitate disciplinary action.

The same standards regarding plagiarism apply to team projects as to the work of individuals, except that the author is now the entire team rather than an individual. Anything taken from a source outside the team should be be properly cited.

One additional issue that arises from the team authorship of project reports is that all team members must stand behind all reports bearing their names. All team members have quality assurance responsibility for the entire project. If there is irreconcilable disagreement within the team it is necessary to indicate as much in the reports; this can be in the form of a ``minority opinion'' or ``dissenting opinion'' section where appropriate.

Late assignments

All lab assignments are due at the beginning of class on the day indicated. Late lab assignments will be penalized by one ``grade notch'' (such as A to A- or A- to B+) for each weekday late or fraction thereof. However, no late assignments will be accepted after graded assignments are handed back or solutions are distributed.

If you are too sick to complete an assignment on time, you will not be penalized. Simply write ``late due to illness'' at the top of the assignment, sign your name and hand it in. Other circumstances will be evaluated on a case-by-case basis.

Please see the separate homework policy, linked to the web version of this syllabus.

Grade changes

Please point out any arithmetic or clerical error I make in grading, and I will gladly fix it. You may also request reconsideration if I have been especially unjust.


I will provide you with a grade on each homework assignment and lab assignment, in addition to the mid-term and final grades, so that you may keep track of your performance. The homeworks will contribute half of your final grade, with the labs contributing the other half. However, I reserve the right to subjectively adjust your final grade. Please see me if you have any question how you stand. Class participation is not graded; however, it allows you to find and repair the gaps in your understanding before doing the assignments, and thus can dramatically improve your grade. You are responsible for all course material, whether or not you are present when it was covered or distributed.

Please see the separate homework policy, linked to the web version of this syllabus.

Style guidelines

All assignments should be readily readable, and should not presuppose that I already know what you are trying to say. Use full English sentences where appropriate (namely almost everywhere) and clear diagrams, programs, etc. Remember that your goal is to communicate clearly, and that the appearance of these technical items plays a role in this communication process. Be sure your assignments are always stapled together and that your name is always on them.


Please contact me immediately if you have a learning or physical disability requiring accommodation.


In the reading column, section 0 means the material at the beginning of a chapter before the first section. When a reading is indicated as going to a particular page number, it means up to the heading on that page. The same section number on the next class day then indicates to finish the section.

This is my best guess as to the rate at which we will cover material. However, don't be shocked if I have to pass out one or more revised syllabi.
2/111.0-2.2Introduction, syntax definition
2/132.3-2.4Syntax-directed translation
2/142.5-2.6Your first compiler
2/15Lab 1: A First Compiler

2/183.0-3.1, 3.3, 3.5Lexical analysisHW 1
2/20Lexical-analyzer generators
2/214.0-4.2Context-free grammars
2/22Lab 1 (continued)

2/254.3Writing a grammar
2/274.4-p.188Top-down parsingLab 1
2/28No class
2/29No class

3/44.4More on predictive parsingHW 2
3/6Lab 2: Adding Variables
3/74.5, 4.7-p.220Bottom-up parsing
3/84.7-p.230SLR parser generation

3/114.7-p.240Canonical LR and LALR parser generation
3/13Lab 2 (continued)HW 3
3/144.8-p.251, 4.9Using ambiguous grammars; parser generators
3/155.0-5.3Syntax-directed definitions

3/18Abstract Syntax Trees (Lab 3 preview)Lab 2
3/20Lab 3: Generating Better Code from ASTs
3/218.0-8.1Intermediate code
3/22Lab 3 (continued)

3/25Lab 3 (continued)
3/27Lab 3 (continued)
3/288.2-8.3, p.481Declarations and simple assignments

4/88.3Array access; type conversions
4/108.4Control flowLab 3
4/117.0-7.2Run-time environments
4/12Lab 4: Control Flow and Scoping

4/157.3Storage-allocation strategies
4/17Lab 4 (continued)HW 4
4/18Modern run-time environment issues
4/199.0-9.3Code generation

4/229.4Basic blocks and flow graphsLab 4
4/24Lab 5: Procedures
4/2610.4Loops in flow graphs

4/2910.5Data-flow analysis
5/1Lab 5 (continued; Mayday: 12:10-12:40)
5/210.6Iterative data-flow analysis
5/3Liveness analysisHW 5

5/6Lab 5 (continued)
5/7notesInterference graphs (Tuesday class)
5/8More on register allocation
5/9No class
5/10Lab 5 (continued)

5/13Lab 5 (concludes)
5/15Lab 6: Wildcard LabLab 5
5/16notesSuppression of partial redundancy
5/17Lab 6 (continued)HW 6

5/20Lab 6 (concludes)
5/22Synthesis; evaluationLab 6

Course web site:
Instructor: Max Hailperin <>