| Lectures, Exams, and Assignments, Fall 2002 | ||||
| Week | Dates | Topic | Recitation / Exam | Text |
| 1 | Aug 26, 28, 30 | Intro, course organization.
Programming language(PL) overview. Syntax versus semantics. Run-time versus compile-time. Compiler overview. Translation versus interpretation. |
1. No goto | 1 |
| 2 | Sept 4, 6 (Sept 2: Labor day) |
Lexical analysis, finite state machines | 2. Lexical Analysis and FSMs | 4.2 |
| 3 | Sept 9, 11, 13 | Formal description of PLs.
Grammars (context-free grammars). |
3. Formal Grammars | 3.3 |
| 4 | Sept 16, 18, 20 | Grammars con't. Flow diagrams.
Parsing and ambiguity. |
4. Shift reduce parsing | 4.5 |
| 5 | Sept 23, 25, 27 | More on parsing | 5. Recursive descent parsing | 4.4 |
| 6 | Sept 30, Oct 2, 4 | Formal semantics | 6. Initial translator | Notes |
| 7 | Oct 7, 9, 11 | Arrays and pointers in C/C++/Java | 7. while and if-then-else | 6 |
| 8 | Oct 14, 16, 18 | Functions and parameters | 9, 10 | |
| 9 | Oct 21, 23, 25 (Oct 25: Last drop) |
Review |
Midterm Exam
(review , answers) |
|
| 10 | Oct 28, 30, Nov 1 | structs and classes | Lisp Rec 1:
Basics and Functions Due Nov. 15 at the latest! |
11, 12 |
| 11 | Nov 4, 6, 8 | Genericity, start Lisp | Lisp Rec 2:
Functions and mapcar Due Nov. 22 at the latest! |
9.8 |
| 12 | Nov 11, 13, 15 | Lisp, then Prolog | Postscript Rec 1:
Basics Due: Nothing to hand is so far! |
15 |
| 13 | Nov 18, 20, 22 | Postscript | Postscript Rec 2:
Business Card Due Dec. 4 at the latest! |
16 |
| 14 | Nov 25, 27 (Nov 28: Thanksg.) |
Leeway | Prolog Recitation Due Dec. 4 at the latest! |
|
| 15 | Dec 2, 4
(Dec 5, 6: Study) |
Leeway. | Generic Constructs | |
| Dec 11 (Wed) | Final Exam (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 recitations: Eventually each recitation will have its own link to the detailed requirement. Outline of recitations.
Details about Exams: Exams appear in green in the table above.
Textbook:
Concepts of Programming Languages, Fifth Ed.
By Robert W. Sebesta,
Addison-Wesley, 2002.