Lectures

Date	Topic (and notes, when available)	Homework Due This Class	Reading For This Class
Mon Jan 13 	Course Overview	Start PA1
Wed Jan 15	History of PL Functional Programming		Required: Chapters 10.1 - 10.3, 10.5 - 10.8, 13.2.4 Optional: Joel Spolsky's The Perils of JavaSchools
Mon Jan 20	no class, MLK Day	PA1c (Rosetta Checkpoint) Due
Wed Jan 22	Functional Programming Overview of Cool		Required: The Cool Reference Manual J. W. Backus. Speedcoding. Journal of the ACM 1(1) pp. 4-6, 1954.
Mon Jan 27	Lexical Analysis & Finite Automata (Part 1)	PA1 (Rosetta) Due	Required: Chapters 2.1 - 2.2 On-Line: Weimer's Udacity CS 262 — Programming Languages — Lesson 1 "Breaking up Strings" to "Hyphenation" Zeller's Udacity CS 259 — Software Debugging — Lesson 3 Simplifying Failures, Implementing the Strategy, Delta Debugging. (If you can't find these exact names, watch the videos for comprehension until you're confident that you've covered similar topics.) Optional: Andreas Zeller. Why programs fail: a guide to systematic debugging. Part of the Delta Debugging project. Edsger Dijkstra. How do we tell truths that might hurt? EWD498, 1975. P. J. Landin. The next 700 programming languages. Communications of the ACM 9(3) pp. 157-166, 1966.
Wed Jan 29	More Finite Automata (Part 2)		On-Line: Weimer's Udacity CS 262 — Programming Languages — Lesson 1 "Tricky" to "Nondet to Det"
Mon Feb 03	Context-Free Grammars, Parsing, Derivations, Ambiguity	WA1 Due PA2 (Lexing) Due	Required: Chapters 2.4 - 2.4.1 CD Chapters 2.4 - 2.4.1 On-Line: Weimer's Udacity CS 262 — Programming Languages — Lesson 2 "Specification" to "It Could Be Worse"
Wed Feb 05	Top-Down Parsing, History, Earley	(Start PA3 early; look at the Midterm schedule to see why.)	Required: Chapters 2.3 - 2.3.2 On-Line: Weimer's Udacity CS 262 — Programming Languages — Lesson 3 "Bag of Words" to "Expanding Exp" Optional: Wikipedia's LL Parsing Mike Clark's Removing Left Recursion Robert Ball's First Sets, Follow Sets and LL(1) Tables
Mon Feb 10	Earley Parsing and Examples	WA2 Due	Required: Chapter 2.3.3 earley.py — a classroom Earley parser On-Line: Weimer's Udacity CS 262 — Programming Languages — Lesson 4 "Time Flies" to "Expanding Exp" Optional: Wikipedia's Earley Parsing Wikipedia's LR Parsing
Wed Feb 12	Midterm 1 (in class) (1 hour 30 minutes if needed)	(Do not forget PA3.)
Mon Feb 17	Code Generation (Part 1)	WA3 Due PA3 (Parsing) Due	Required: The Cool Reference Manual (no, really) Required for Compilers Only: Chapter 14.1 CD Chapters 5 - 5.3.2
Wed Feb 19	Code Generation (Part 2)		Required for Compilers Only: USC CS 410 Lecture Notes: "Code Generation for a Stack Machine" CD Chapter 5.4
Mon Feb 24	Scoping & Types	Compilers: PA6c (Compiler Checkpoint) Due	Required: Chapters 3.1 - 3.6 On-Line: Weimer's Udacity CS 262 — Programming Languages — Lesson 5 "Formal Semantics" to "Conclusion" Optional: Wikipedia's Scope (programming)
Wed Feb 26	Type Checking & Static Semantics		Required: Chapters 4 - 4.1, 7 - 7.1 Optional: Luca Cardelli's Type Systems (recommended)
Mon Mar 03	no class, snow day	PA4t (Semantics Test-Driven) Due
Wed Mar 05	More Static Semantics	PA4c (Semantics Checkpoint) Due	Required: Chapters 7.2 - 7.3 Optional: Wikipedia's Type system
Mon Mar 17	no class, snow day
Wed Mar 19	Cool Type Checking, Runtime Organization	WA4 Due PA4 (Semantics) Due	Required: Chapters 8.1 - 8.3 Required for Compilers Only: CD Chapter 8.2.2 Optional: Chapter 6 of Grant, Palmer & Smith's Princples of Programming Languages
Mon Mar 24	Multi-Language Projects		Required: Wikipedia's Java Native Interface Python's Extending Python with C or C++ Optional: OCaml's Interfacing C with OCaml
Wed Mar 26	Operational Semantics		Required: Chapters 9 - 9.4 Chapters 2 - 2.2.3 and 2.3.3 of Grant, Palmer & Smith's Princples of Programming Languages Required for Compilers Only: Wikipedia's Virtual method table Optional: Bjarne Stroustrup. What is "Object-Oriented Programming"?. 1991 Wikipedia's Object-oriented programming
Sun Mar 30 Thn E303 (same time/room)	Introduction to Game Theory		Optional: Wikipedia's Game Theory
Mon Mar 31	Basic Blocks, Local Optimizations	WA5 Due PA5t (Interpreter Test-Driven) Due	Required: Wikipedia's Basic block On-Line: Weimer's Udacity CS 262 — Programming Languages — Lesson 6 "Optimization" to "Wrap Up"
Wed Apr 02	Dataflow Analysis, Global Optimizations		Required: Wikipedia's Data-flow analysis CD Chapter 16 - 16.4 Required for Compilers Only: CD Chapter 5.5 - 5.6 CD Chapter 16.5 - 16.9
Mon Apr 07	Automatic Memory Management	WA6 Due	Required: Chapter 7.7 Optional: David F. Bacon, Perry Cheng, V. T. Rajan. A unified theory of garbage collection. In Object-Oriented Programming Systems, Languages and Applications, pp. 50-68, 2004.
Wed Apr 09	Exceptions and Error Handling	Compilers: PA6 (Compiler) Due	Required: Chapter 8.5
Mon Apr 14	Debuggers and Profilers	WA7 Due PA5c (Interpreter Checkpoint) Due	Required: Chapters 15.3.2 and 15.3.3 Susan L. Graham, Peter B. Kessler, Marshall K. McKusick. gprof: a call graph execution profiler. In Best of Programming Languages Design and Implementation 1979-1999, pp. 49-57, 2004. On-Line: Weimer's Udacity CS 262 — Programming Languages — Lesson 6 "Web Browser Architecture" to "Debugging in the Real World"
Wed Apr 16	Linking, Loading and Shared Libraries		Required: Chapters 14.4 and 14.6 CD Chapter 3.8 CD Chapter 14.7 Optional: Software Usability II by Tom Davis (a description of how software engineering (and shared libaries, called "DSO"s) played out as Silicon Graphics was developing the IRIX Operating System for the SGI Indy workstation)
Mon Apr 21	Midterm 2 (in class) (1 hour 30 minutes if needed)
Wed Apr 23	Language Security		Required: Aleph One. Smashing The Stack For Fun And Profit. In Phrack 7(49):14, 1996.
Mon Apr 28	Internet Security		Required: Ken Thompson. Reflections on Trusting Trust. ACM Turing Award Speech. On-Line: Weimer's Udacity CS 262 — Programming Languages — Lesson 7 "Final Unit" to "Victory"
Wed Apr 30 Thn E303 (same time/room)	Quantum Computing, and/or Romance Novels
Mon May 05		PA5 (Interpreter) Due 11:50pm Compilers: PA7 (Optimizer) Due 11:50pm Late Electronic/PA Submissions Due 11:50pm Late Written Course Materials Due 5:00pm Oral Examinations Completed 5:00pm