CS 4410/6410: Compiler Design
Syllabus --Spring 2021
NOTE: This page is for an old semester of CS4410. To go to the current semester, click here.
Meeting places & times
Richards 458, Monday and Wednesday 2:50 PM – 4:30 PM
Course staff & office hours
Instructor |
|
|
|
| online |
| Thursday 2:00–4:00pm, | |
TA: |
| Luke Novak |
|
|
| online |
| Monday 12:30–2:30, |
CCIS Tutors: |
|
|
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.
Prerequisites
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.
Exams
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.
Materials
Software
Programming assignments will use several pieces of software:
OCaml, version 4.09 or higher (the latest is 4.11.1) – there have been breaking changes in the standard library prior to 4.09, and not all of the starter code might work for you otherwise.
OUnit, a unit-testing framework similar to JUnit. The easiest way to install OUnit is via OPAM, the OCaml package manager.
nasm, an open-source assembler
Valgrind, a tool for checking memory-safety
Clang, a compiler for C programs. (You may use gcc if you prefer, but you’ll be on your own to ensure that everything works correctly.)
There is no specific IDE for OCaml; I tend to use emacs, but you may use any editor you wish.
Books
There is no required textbook, but you may find these books useful.
|
|
|
|
|
Online resources
OCaml Resources
Introduction to Objective Caml, book on OCaml by Jason Hickey (online version)
A nice OCaml overview by Scott Smith
Some OCaml tutorials
For OCaml support in emacs, download tuareg (recommended) or this. If you’re feeling adventurous, these two packages provide some interesting but preliminary support for OCaml via a language-server-protocol implementation.
Comparison of SML and OCaml, by Andreas Rossberg
ledit, a tool to provide emacs-like editing (and history) to the OCaml toplevel. Information on how to use ledit, and other tips for using the toplevel are available here
See the INRIA web pages for information on ocamllex and ocamlyacc.
An interactive tutorial on using Git
X86 Resources
X64 Resources
(I will add to this list over the semester as I find useful guides. Email me if you have suggestions.)
A tutorial on NASM (specifically x64- and macOS-related issues)
Lectures
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.
Date |
| Topics (tentative and approximate) |
| Materials |
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 |
| |
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 |
| Objects |
| |
4/19 M |
| Lexing |
| |
4/21 W |
| Parsing |
|
Testing
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.
Link |
| Assigned |
| Due |
Assignment 0 |
| Wed 01/20 |
| Sun 01/24 |
Assignment 1 |
| Wed 01/20 |
| Tue 01/26 |
Assignment 2 |
| Wed 01/27 |
| Tue 02/02 |
Assignment 3 |
| Wed 02/03 |
| Thu 02/11 |
Assignment 4 |
| Fri 02/12 |
| Thu 02/18 |
Assignment 5 |
| Mon 02/22 |
| Tue 03/02 |
Assignment 6 |
| Wed 03/03 |
| Fri 03/12 |
Assignment 7 |
| Mon 03/15 |
| Mon 03/29 |
Assignment 8 |
| Wed 03/17 |
| Fri 03/19 |
Assignment 9 |
| Tue 03/30 |
| Wed 04/07 |
Assignment 10 |
| Thu 04/08 |
| Mon 04/19 |
Assignment 11 |
| 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.
Homework
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 —
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.
Grades
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.
Cutoff |
| 93% |
| 90% |
| 86% |
| 83% |
| 80% |
| 76% |
| 73% |
| 70% |
| 66% |
| 63% |
| 60% |
| else |
Letter grade |
| A |
| A- |
| B+ |
| B |
| B- |
| C+ |
| C |
| C- |
| D+ |
| D |
| D- |
| F |