9/12/09: Clarification about step 2. In addition to printing "accept" or "not accept" if the program you are parsing is syntactically correct or not, I would like you to also print out the productions as you recognize them. In a top-down parser, you should print out productions whenever you push more symbols on the stack (or, in a recursive-descent parser, whenever you invoke a new method). For a bottom-up parser, you should print out productions whenever you reduce.

9/9/09: Updated slides for Lecture 4 posted. Also, I will be out of town on Tuesday the 15th; class will be taught by Professor Midkiff.

9/3/09: The parse table we built in class today is available here

9/1/09: To reduce the load on the TA, you may optionally work with a partner on the project. If you choose to do so, you must (i) turn in just one project to the TA; (ii) let me know who you are working with, and under which username you are submitting your work; and (iii) work with the same partner for all steps of the project.

8/30/09: In order to give the TA time to get all the kinks worked out, Step 1 of the project is now due September 11th (as it says on the project webpage). Instead, turn in Step 0 as specified on the project webpage on September 4th. However, writing the scanner is relatively easy, and the parser is relatively hard, so I would suggest finishing your scanner before September 11th and getting started on your parser.

8/29/09: The full project description is available here. Note that the due dates on the project do not correspond to the due dates on the syllabus. The correct dates are the ones on the syllabus, unless announced otherwise.

8/27/09: The language your compiler will work for is called "Little." The token definitions are at the bottom of the grammar file.

8/25/09: Please submit the answers to this questionnaire to me by email no later than September 1st. Filling out the survey is worth 5 bonus points on the first midterm.