Details

Home Details Schedule

Course Time and Location

Lectures: TTh 3:00-4:20pm, Friend 008

Mailing List: cs320@cs.princeton.edu

You are encouraged to use the CS 320 mailing list to ask questions of other students in the class about the course material.  The course staff will read the mailing list and interject or answer questions when appropriate.  Occasionally, the course staff will make announcements via the mailing list so all members of CS 320 are required to subscribe and read their CS 320 email.

To subscribe, send email to Majordomo@cs.princeton.edu from your account with the following command in the body of your message:

subscribe cs320

Software

Most of the assignments will be programmed in SML, which has often been called "a domain specific programming language for building compilers."  If you have a PC running Linux, then you should also be able to install ML there. You can grab a copy of the compiler from the official server at Bell Labs.

In a couple of days, you can also use CIT Sparc machines (CS 101 cluster, sunlab1-sunlab4, yuma, tucson, flagstaff).  Follow the directions given on assignment No. 1.

Professor

David Walker

* Office: 412 CS Building
* Phone: 258-7654
* E-Mail: dpw@cs.princeton.edu
* Office hours: TTh 4:30-5:30PM or by appointment

Teaching Assistant

Jay Ligatti

* Phone: 258-1763

* E-Mail: jligatti@cs.princeton.edu

* Office Hours:  Friday 3:30-4:30, CS 418a

Undergraduate Coordinator

Tina McCoy

* Office: 410 CS Building
* Phone: 258-1746
* E-Mail: tmhill@cs.princeton.edu

Texts:

* Andrew W. Appel, Modern Compiler Implementation in ML. Cambridge University Press, 1998.  (Required)

* Jeffrey D. Ullman, Elements of ML Programming, second edition, Prentice Hall.  (Recommended)

More information on ML including tutorials is available here.


Grading

Your grade will be calculated as follows:

TBA

Exams

There will be a midterm exam and a final exam. The exercises at the end of each chapter of Modern Compiler Implementation in ML are representative of the questions that will appear on the exam. The best way to study for the exams is to do these exercises.

Assignments

There will be about 10 weekly programming assignments. These assignments are described on the assignments web page. You can get help with the assignments by sending electronic mail to cs320 or directly to the teaching assistant (see above), or by calling or visiting Professor Walker or the teaching assistant. Ask for help when you need it!

The late policy is to encourage submissions that are on-time. Therefore, you will lose 30% credit on the first day and 10% for each additional day late. This means that all credit is lost one week after the due date.

There will be no extensions due to scheduling conflicts, computer downtime, or other such factors, except under truly extraordinary circumstances. Extensions will be granted only for university-sanctioned excuses such as illness, and then only with the proper documentation. You are responsible for planning ahead and managing your time so that you can complete the assignments on time. You must either finish on time or accept the consequences of doing otherwise.

Penalties are waived only for unforeseen circumstances, like illness, and then only with an appropriate written excuse.

Programming, like composition, is an individual creative process. Individuals must reach their own understanding of the problem and discover a path to its solution. During this time, discussions with friends are encouraged. However, when the time comes to write the code that solves the problem, such discussions are no longer appropriate - the program must be your own work (although you may ask teaching assistants for help in debugging). If you have a question about how to use some feature of C, UNIX, ML, etc., then you can certainly ask your friends or the teaching assistants.

Do not, under any circumstances, copy another person's program. Writing code for use by another or using another person's code in any form violates the University's academic regulations.

Back to Top
 

Last updated: February 04, 2003.