6.8

CS 4410/6410: Compiler Design

Syllabus --Spring 2017

Meeting places & times

Our class meets twice a week, at different times:

Course staff & office hours

Instructor

  

Benjamin Lerner

  

blerner@ccs

  

314 WVH

  

Mon 3:00 – 4:30 PM,
Tue 3:00 – 4:30 PM,
and by appointment

TA:

  

Justin Slepak

  

jrslepak@ccs

  

WVH 308

  

Wed 4:00 – 6:00 PM

CCIS Tutors:

  

See here

Ben Lerner
Ben Lerner

Justin Slepak
Justin Slepak


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 compilier, 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:

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.


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


Lectures

This table specifies the lecture schedule; topics are tentative.

Date

 

Topics (tentative and approximate)

 

Materials

1/10 T

 

Introduction, OCaml practice

 

notes

1/12 Th

 

Tiny compiler: grammar, abstract syntax, and instructions

 

notes

1/17 T

 

Names, scope and (simple) stacks

 

notes

1/19 Th

 

 

1/24 T

 

A-Normal Form

 

notes

1/26 Th

 

Multiple data types and tagging values

 

notes

1/31 T

 

Errors and calling functions

 

notes

2/2 Th

 

Function declarations

 

notes

2/7 T

 

Overflow and Tail Calls

 

notes and notes

2/9 Th

 

 

2/14 T

 

Heap allocation and pairs

 

notes

2/16 Th

 

α-renaming

 

2/21 T

 

First-class functions

 

notes

2/23 Th

 

Closures

 

2/28 T

 

Memory management

 

3/2 Th

 

Automated memory management, Mark/compact

 

3/7 T

 

No class: Spring Break

 

3/9 Th

 

No class: Spring Break

 

3/14 T

 

No class: Snow day

 

3/16 Th

 

Types and Compilation

 

3/21 T

 

Intermediate representations, abstract locations, and register allocation

 

3/23 Th

 

 

3/28 T

 

Optimization, generally: CSE & more

 

3/30 Th

 

 

4/4 T

 

 

4/6 Th

 

Lexing

 

4/11 T

 

Parsing

 

4/13 Th

 

 

4/18 T

 

Wrap-up

 


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: OCaml warmup 1: basics

  

Tue 01/10

  

Fri 01/13

Assignment 1: OCaml warmup 2: trees

  

Tue 01/10

  

Tue 01/17

Assignment 2: Adder: A starter language

  

Wed 01/18

  

Tue 01/24

Assignment 3: Boa: Adding new operators

  

Wed 01/25

  

Tue 01/31

Assignment 4: Cobra: Multiple types of values

  

Wed 02/01

  

Tue 02/07

Assignment 5: Diamondback: Defining functions

  

Thu 02/09

  

Thu 02/16

Assignment 6: Egg-eater: Tuples

  

Thu 02/16

  

Thu 02/23

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

  

Fri 02/24

  

Fri 03/03

Assignment 8: Garter: Garbage Collection and Type-Checking

  

Sat 03/04

  

Tue 03/21

Assignment Written 1: Adding new data types

  

Thu 03/16

  

Fri 03/17

Assignment 9

  

Wed 03/22

  

Fri 03/31

written2

  

Wed 03/29

  

Thu 03/31


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.

Submitting by email

Homework will ordinarily be submitted to the CS 4410 submission server at https://handins.ccs.neu.edu. However, sometimes (detailed below) it may be necessary to submit by email. In this 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.

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.

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.

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 homework or exam, but please do not bank on such a chance.

The mapping of raw point totals to letter grades is given below. Please note that these grade boundaries may move slightly at the discretion of the instructor, but the grade boundary for A is unlikely to change.

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