|Lecture:||Mondays, 7:10-9:00pm, CIWW 202|
|Instructors:||Eva Rose (firstname.lastname@example.org) and Kristoffer H. Rose (email@example.com)|
|Instructors's office hours:||Mondays, 6-7pm, CIWW 328, or by appointment|
|Prerequisites:||G22.1170 (algorithms), G22.2110 (programming languages), and G22.2250 (operating systems)|
|Grader:||José Pablo Cambronero (firstname.lastname@example.org)|
|Grader's office hours:||Thursdays, 6-7pm, CIWW 229 (Computer Lab)|
The course description below is quoted from the Graduate School of Arts and Science Bulletin:
This is a capstone course based on compilers and modern programming languages. The topics covered include structure of one-pass and multiple-pass compilers; symbol table management; lexical analysis; traditional and automated parsing techniques, including recursive descent and LR parsing; syntax-directed translation and semantic analysis; run-time storage management; intermediate code generation; introduction to optimization; and code generation. The course includes a special compiler-related capstone project, which ties together concepts of algorithms, theory (formal languages), programming languages, software engineering, computer architecture, and other subjects covered in the MS curriculum. This project requires a substantial semester-long programming effort, such as construction of a language compilation or translation system that includes lexical and syntactic analyzers, a type checker, and a code generator.
Specifically, the course will follow the
(second edition) as the text book. In the semester-long programming
project, we will implement a fully functional compiler for a simple
programming language. The implementation will use the
compiler-generator tool HACS (part of the open source
Here is the schedule. Each lecture links to the slides for that
lecture, as they become available. Paragraph references are to the
dragon book, except
Hn references to sections of the
HACS manual and
An references to the
(both quoted in the materials above).
Note that the contents of every provided link is subject to change up to end of the day of the lecture it is associated with.
|Date||Lecture topic||Reading||Homework||Project milestone|
|Mon 1/26||1. Introduction||1.1-1.2 (12p), H1-2||hw1|
|Mon 2/2||2. Lexical analysis||3.1-3.4,3.6,3.7 (50p), H3||hw2|
|Mon 2/9||3. Top-down syntax analysis||2.4 + 4.1-4.4 (50p), H4||hw3||Project Milestone 1: pr1 due 2/27, samples.zip (corrected)|
|Mon 2/16||Presidents Day|
|Mon 2/23||4. Syntax-directed translation and recursive HACS||2.3 + 5.4 (21p), H5, H9||hw4|
|Mon 3/2||5. Syntax-directed definitions and type analysis||5.1-5.3 + 6.3, 6.5 (40p)||hw5||Project Milestone 2: pr2 due 3/9 and 3/31|
|Mon 3/9||6. Name analysis and SDD to HACS translation||1.6 + 2.7 (15p), H6-8||hw6|
|Mon 3/16||Spring Recess|
|Mon 3/23||7. Intermediate code generation||6.1, 6.2, 6.4, 6.6, 6.9 (34p)||hw7|
|Mon 3/30||Midterm exam|
|Mon 4/6||8. Runtime environments||7.1-7.4 (36p), A1||hw8 (solution)|
|Mon 4/13||9. Code generation||8.1-8.4 (28pp), A2||hw9||Project Milestone 3: pr3 due 4/20 and 5/1|
|Mon 4/20||10. Register allocation||8.6 + 8.8 (11p)||hw10|
|Mon 4/27||11. Bottom-up syntax analysis||4.5 + 4.6 (26p)||hw11|
|Mon 5/4||12. Optimization||8.5 + 8.7 + 9.1 (26p)||—|
|Mon 5/11||Final exam|
There are homework assignments most weeks (the schedule indicates when homework is assigned). These test your understanding of material beyond the immediate hands-on knowledge needed for the project. Each homework assignment is made available after the appropriate lecture, and must be submitted into the NYUClasses system before the specified deadline, typically in the morning on the day of the subsequent lecture.
There are project milestones, which involve a substantial amount of programming (the schedule indicates when they are assigned) as well as documentation requirements. Each milestone builds on code from the previous milestone, however, reference code will be made available before each as an alternative to your own code from the previous stage. Project milestones must be submitted into the NYUClasses system no later than the specified due date.
You can develop the project on your own machine, but must make sure that it works on the energon1.cims.nyu.edu to energon4.cims.nyu.edu machines at NYU, as we will test the code there.
There are two exams: a midterm and a final. The exams cover similar questions as the homeworks. The final exam is cumulative: it will cover material from the entire semester.
Final grades will be calculated to 15% from homeworks, 45% from the project, 15% from the midterm exam, and 25% from the final exam.
|Machines at Courant:||http://cims.nyu.edu/webapps/content/systems/resources/computeservers|
|Graduate cs.nyu.edu courses:||http://cs.nyu.edu/webapps/fall2014/Graduate/courses|
|Graduate cs.nyu.edu calendar:||http://cs.nyu.edu/webapps/Graduate/calendar|
|Previous Incarnations:||Fall '14 (Eva Rose and Kristoffer Rose), Spring'14 (Kristoffer Rose with Eva Rose), Fall'13 (Martin Hirzel and Kristoffer Rose), Spring'13 (Hubertus Franke), Fall'12 (Mohamed Zahran), Fall'11 (Martin Hirzel), Spring'09 (Allan Gottlieb)|
|Academic integrity policy:||http://cs.nyu.edu/web/Academic/Graduate/academic_integrity.html|