| Lectures, Exams, and Assignments, Spring 2003 | |||
| Week | Dates | Topic | Recitation / Exam |
| 1 | Jan 13, 15, 17 | Intro, course organization.
Programming language(PL) overview. Syntax versus semantics. Run-time versus compile-time. Compiler overview. Translation versus interpretation. |
No goto |
| 2 | Jan 22, 24
(Jan 20: MLK) |
Lexical analysis, finite state machines | Lexical Analysis and FSMs |
| 3 | Jan 27, 29, 31 | Formal description of PLs.
Grammars (context-free grammars). |
Formal Grammars |
| 4 | Feb 3, 5, 7 | Grammars con't. Flow diagrams.
Parsing and ambiguity. |
Shift reduce parsing |
| 5 | Feb 10, 12, 14 | More on parsing |
Tiny Compiler 1: Recursive descent parsing |
| 6 | Feb 17, 19, 21 | Formal semantics |
Tiny Compiler 2: Initial translator |
| 7 | Feb 24, 26, 28 | Arrays and pointers in C/C++/Java |
Tiny Compiler 3: while and if-then-else |
| 8 | Mar 3, 5, 7 | Functions and parameters | C/C++/Java 1: Functions and Arrays |
| 9 | Mar 10, 12, 14 (Mar 14: Last drop) |
Review | C/C++/Java 2:
Classes Midterm Exam (review) |
| Spring Break, Mar 17-22 | |||
| 10 | Mar 24, 26, 28 | structs and classes | C++/Java: Generic Constructs |
| 11 | Mar 31, Apr 2, 4 | Genericity, start Lisp | Lisp Rec 1: Basics and Functions |
| 12 | Apr 7, 9, 11 | Lisp, then Prolog | Lisp Rec 2: Functions and mapcar |
| 13 | Apr 14, 16, 18 | Postscript | Postscript
Rec 1: Basics |
| 14 | Apr 21, 23
(Apr 25: B of F) |
Leeway | Postscript
Rec 2: Business Card |
| 15 | Apr 28, 30
(May 1, 2: Study) |
Leeway. | Prolog Recitation |
| May 6 (Wed) | Final
Exam, (Answers, review) |
||
Late Penalties: A policy about late recitations will be formulated early in the semester.
No Team Programming: Recitations are to be done individually. You are allowed to help one another, but you must not just give code to another student, nor may you receive such code.
Details about Exams: Exams appear in green in the table above.