CS 4410/6410: Compiler Design

Syllabus --Spring 2021

Meeting places & times

Course staff & office hours



Benjamin Lerner






Thursday 2:00–4:00pm,
and by appointment



Luke Novak






Monday 12:30–2:30,
Wednesday 4:45–6:45

CCIS Tutors:


See here

Ben Lerner
Ben Lerner

Luke Novak
Luke Novak

General information

CS 4410 covers the implementation of efficient compilers for programming languages. The course focuses on the connections between language features and the impact they have on the design of a compiler, including any associated algorithms and pragmatic issues, and practical applications including those outside of programming languages proper. Participants build a working compiler including lexical analysis, parsing, type checking, code generation, and register allocation. As a secondary emphasis, the course exposes students to run-time issues and optimization.


This course assumes familiarity with programming in the style of How to Design Programs, and basic knowledge of functional programming as introduced in CS 2510, and C programming as introduced in CS3650.


At the moment, I am not planning on giving formal exams. However, we will likely have two or three written assignments (as opposed to the project assignments) that will serve a similar purpose. There is a final exam time scheduled for this course, but we may not use it. We will likely have project presentations due during exam week, so don’t assume the course is over before then.



Programming assignments will use several pieces of software:

There is no specific IDE for OCaml; I tend to use emacs, but you may use any editor you wish.


There is no required textbook, but you may find these books useful.

Andrew Appel, Modern Compiler Implementation in ML, Cambridge University Press, 1998.


Keith D. Cooper and Linda Torczon, Engineering a Compiler, 2nd Ed., Morgan Kaufmann, 2004.


Alfred V. Aho, Monica S. Lam, Ravi Sethi, and Jeffrey D. Ullman, Compilers: Principles, Techniques, and Tools, Pearson Education Inc, 2006.

Online resources

OCaml Resources

X86 Resources

X64 Resources

(I will add to this list over the semester as I find useful guides. Email me if you have suggestions.)


This table specifies the lecture schedule; topics are tentative.

I will be publishing lectures notes somewhat on-demand, as I update them for x64 assembly. In the meantime I’m leaving them private, so they are not needlessly confusing.



Topics (tentative and approximate)



1/18 M


No class: MLK Day


1/20 W


Introduction, OCaml practice



1/25 M


Tiny compiler: grammar, abstract syntax, and instructions



1/27 W


Names, scope and (simple) stacks



2/01 M


A-Normal Form (part 1)



2/03 W


A-Normal Form (part 2)


2/08 M


Multiple data types and tagging values



2/10 W


Errors and calling functions



2/15 M


No class: Presidents’ Day


2/17 W


Function declarations



2/22 M


Overflow and Tail Calls


notes, notes and notes

2/24 W


α-renaming, Type checking



3/01 M


Type inference



3/03 W


Heap allocation and pairs



3/08 M


Mutually-recursive declarations and types; mutable tuples



3/10 W


Work on Taipan


3/15 M


First-class functions



3/17 W


Closures; work on Egg-eater


3/22 M


Memory management



3/24 W


No class: Care Day


3/29 M


Automated memory management, Mark/compact


3/31 W


Enrichment: Pyret runtime, printing values deeper than the stack depth


4/05 M


Enrichment: Pyret compilation and stack management


4/07 W


Intermediate representations, abstract locations, and register allocation; CSE


4/12 M


No class: Care Day


4/14 W





4/19 M




4/21 W





Testing your code is sufficiently important that we’ve devoted an entire page to it. Please read these notes, for each and every assignment you work on.

Homework schedule

Homework will usually be due at 8:59 PM; the day of the week varies, so you should check each individual assignment to be sure. General homework policies are here.

This homework schedule is tentative and subject to change at the instructor’s discretion.






Assignment 0: OCaml warmup, part 1: basics


Wed 01/20


Sun 01/24

Assignment 1: OCaml warmup, part 2: trees


Wed 01/20


Tue 01/26

Assignment 2: Adder: A starter language


Wed 01/27


Tue 02/02

Assignment 3: Boa: Adding new operators


Wed 02/03


Thu 02/11

Assignment 4: Cobra: Multiple types of values


Fri 02/12


Thu 02/18

Assignment 5: Diamondback: Defining functions


Mon 02/22


Tue 03/02

Assignment 6: Taipan: Checking and inferring types


Wed 03/03


Fri 03/12

Assignment 7: Egg-eater: Tuples


Mon 03/15


Mon 03/29

Assignment 8: Adding new data types


Wed 03/17


Fri 03/19

Assignment 9: Fer-de-lance: Anonymous, first-class functions


Tue 03/30


Wed 04/07

Assignment 10: Garter: Garbage Collection


Thu 04/08


Mon 04/19

Assignment 11: Adding exceptions


Wed 04/14


Fri 04/16

Course policies

Collaboration and academic integrity

You may not collaborate with anyone on any of the exams. You may not use any electronic tools, including phones, tablets, netbooks, laptops, desktop computers, etc. If in doubt, ask a member of the course staff.

All homework assignments will be completed with a partner; some may involve a larger team (TBD). You must collaborate with your assigned partner or team, as specified, on homework assignments. You may request help from any staff member on homework. (When you are working with a partner, we strongly recommend that you request help with your partner, rather than solo.) You may use the Piazza bulletin board to ask questions regarding assignments, so long as your questions (and answers) do not reveal information regarding solutions. You may not get any help from anyone else on a homework assignment; all material submitted must be your own. If in doubt, ask a member of the course staff.

Providing illicit help to another student is also cheating, and will be punished the same as receiving illicit help. It is your responsibility to safeguard your own work.

Students who cheat will be reported to the university’s office on academic integrity and penalized by the course staff, at our discretion, up to and including failing the course.

If you are unclear on any of these policies, please ask a member of the course staff.


In general, you should submit your homework according to the instructions on the web page for the individual assignments.

We have written a guide to using the handin server, which should answer most questions you have. If something is still unclear after reading that, please ask an instructor.

Submission troubles

If you have trouble submitting to the server and you have time before the deadline, please wait few minutes and try again; it may also be worth checking on Piazza to find out whether other students are experiencing similar difficulties. If upon retrying you still cannot submit, email Dr. Lerner (blerner@ccs). Or if you don’t have time to try again then you should submit by email. In this (rare!) case, email your instructor with the subject line “HW N submission” (where N is the appropriate homework number). Attach your source files to the email individually; do not use a ZIP file or other kind of archive. Our email systems reject messages with archive attachments.

Late days & late work

Each student gets four free, no-questions-asked late days for the term. The purpose of late days is make the extension process fair and transparent by getting the instructors out of the extension-granting business entirely. Instead, when you need an extension, you can take one — provided you have a late day remaining.

Using a late day is automatic: simply submit the homework up to one day late. The server will keep track of the number of used late days. Conserve your late days carefully.

No more than one late day may be used on any one homework. Late days cannot be divided fractionally, but must be used whole. Late days cannot be transferred to or shared with a partner, so in order to take an extension both you and your partner must have sufficient late days remaining. Choose your partners carefully.


Your grade will be based on your performance on the problem sets, and the written assignments; exact weights TBD.

The grades will computed on an absolute basis: there will be no overall curving. The instructor may choose to curve an individual assignment, but please do not bank on such a chance.

The estimated mapping of raw point totals to letter grades is given below. Please note that these grade boundaries may move slightly in either direction at the discretion of the instructor: if a particular breakpoint falls in the middle of a tight cluster of numeric grades, we will attempt to move the breakpoint to give that whole cluster the same letter grade. If, near the end of the semester, you are concerned that your grade is hovering near a breakpoint, see me to discuss your concerns.


























Letter grade