General information /
Course Description /
Thursdays 5:10 pm - 7:00 pm, Room WWH 312
Martin Hirzel (email@example.com) and Kristoffer H. Rose (firstname.lastname@example.org)
|Instructors's office hours:||
Thursdays 4:00-5:00, Room CIWW 328, or by appointment
G22.1170 (algorithms), G22.2110 (programming languages), and G22.2250 (operating systems)
Techniques, and Tools (2nd Edition), by Aho/Lam/Sethi/Ullman. Addison Wesley, 2007.
|October 17 guest lecturer:||
Bowen Li (email@example.com)
|Grader's office hours:||
Tuesdays 1:00-2:00, Room CIWW 230
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 “Dragon Book” (second
edition) as the text book. In the semester-long programming project,
we will implement a fully functional compiler for “Tiger”.
Tiger is a simple statically-typed programming language invented by
Andrew Appel for compiler construction courses. The preferred
compiler-generator infrastructure for implementing the project is CRSX. The project consists of multiple
milestones. Each milestone builds on code from the previous milestone,
and that code will be made available to you at the appropriate time.
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.
Final grades will be calculated to 10% from homeworks,
30% from the project, 20% from the midterm exam, and
40% from the final exam.
- There are homework assignments every week. These test your
understanding of material beyond the immediate hands-on knowledge
needed for the project.
- There are project milestones every 2-3 weeks, which involve
a substantial amount of programming.
- 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.
Please carefully read the CIMS department's academic integrity policy.
- You are encouraged to collaborate on homework assignments and project
milestones. But you must write up and turn in your own answers.
Also, you must clearly indicate who you collaborated with.
- During the midterm and the final exam, you must not use any
reference material, and of course, you must not communicate with
your fellow students.
- If we detect any incidents of cheating, we will report them
immediately to the department.
All homework and project assignments will be due on Fridays at 1pm. To
submit homeworks, log into home.nyu.edu, go to Academic →
NYU Classes → Compiler Construction → Assignments, and
upload your file with answers there. Don't forget to click
“submit” before the deadline, just “upload” is
not enough. The policy for late assignments is as follows:
- If you submit at least 1 minute late, but at most 3 hours
late, you receive 50% of the points for that homework.
- Otherwise, late homeworks or project milestones are only acceptable
if the lateness is caused by circumstances beyond your control,
such as illness or a missed flight.
- In this case, you only get the points for the homework if
you provide official documentation, such as a doctor's
certificate, for the reason why your homework is late.
Points from homeworks and exams
Each row contains the points of all 6 enrolled students, in descending
order by points for that particular row. That means that the same
student might be further left in one row and further right in another,
depending on how well they did on that part of the class.
hw1 24 24 24 24 24
hw2 24 24 23 23 19 17
pr1 100 95 95 95 90 80
hw3 24 24 24 18 13 0
hw4 16 16 16 16 15 14
hw5 24 24 23 23 22 22
midterm 37 34 33 32 30 27 //midterm exam
m-score 93 91 83 83 81 76 //calculated from hw1-hw5, pr1, midterm exam
m-grade A A B B B C //based on m-score
hw6 16 16 15 15 15 10
pr2 100 100 100 100 100 100
hw7 36 36 36 36 32
hw8 16 16 16 15 15
pr3 90 90 80 80 80 70
final 58 51 50 48 46 40
f-score 95 86 86 81 81 80
f-grade A A- A- B B B //based on f-score
This file was last checked into CVS $Date: 2014/01/06 16:41:31 $ UTC (New York is at UTC-5).