CS 433 - Spring 2008

Compiler Design


Announcements

Final Exam: Self-scheduled (pick up at my office!), Monday 5/12 - Tuesday 5/20.
The exam is open book / notes, and you may want to bring your notes, handouts (including Omg grammar), homeworks, and solutions. You may not use a computer or access material online during the exam.

Homework

  1. Homework 0: suggest language syntax. Submissions.
  2. Homework 1, due Monday 2/18. Solutions.
  3. Homework 2, due Monday 2/25. Solutions.
  4. Homework 3, due Monday 3/3. Solutions.
  5. Homework 4, due Monday 3/10. Solutions.
  6. Homework 5, due Monday 3/17 and Friday 3/21. Solutions.
  7. Homework 6, due Friday 4/4 and Friday 4/11. Solutions. America's funniest error messages.
  8. Homework 7, due Tuesday 4/22. Solutions.
  9. Homework 8, due Tuesday 4/29. Solutions.
  10. Homework 9, due Monday 5/5 and Friday 5/9.

Lectures & Readings

  1. M 2/11 - Course info, function and structure of a compiler (Ch 1)
  2. W 2/13 - Symbol table organization, language discussion (Ch 2.7, 1st ed. Ch 7.6)
  3. F  2/15 - Regular expressions (Ch 3.3)
  4. M 2/18 - Scanning with Lex/Flex (Ch 3.5, Flex man page, examples)
  5. W 2/20 - Formal grammars, CFGs (Ch 4.1-2)
  6. M 2/25 - Derivations and parse trees (Ch 4.2-3)
  7. W 2/27 - Parsing with Yacc (Ch 4.9, Yacc paper, examples)
  8. F  2/29 - Syntax tree, HW 3, debugging
  9. M 3/3  - Declaration resolution, nested scopes (Ch 2.7)
  10. W 3/5  - Intro to parsing, top-down parsing, LL(1) and S grammars, parse.omg (Ch 4.4)
  11. F  3/7  - Bottom-up parsing, LR(k) grammars, handles, rewriting grammars (Ch 4.5, 4.3)
  12. M 3/10 - Rewriting grammars, declaration resolution for functions and parameters (Ch 4.3)
  13. W 3/12 - LR(0) parsing, LR(0) items, viable prefix (Ch 4.5, 4.6.1-2, 4.6.5)
  14. F  3/14 - LR(0) machine, DFAs, goto, closure (Ch 4.6.2, notes on LR(0) parsing)
  15. M 3/17 - LR(0) parsing summary, resolution of named types and structures
  16. W 3/19 - Run-time storage management, displacements (Ch 7.1-3)
  17. F  3/21 - Type checking (Ch 6.5)
  18. M 3/31 - HW 6, Intro to code generation (Ch 8.1)
  19. W 4/2 - Pentium assembly review, code generation for variables and arrays
  20. F  4/4 - Low-level code generation, managing of temporaries
  21. M 4/7 - Dynamic memory allocation (Ch 7.4)
  22. W 4/9 - Garbage collection (Ch 7.5-6)
  23. F  4/11 - No class (programming contest)
  24. M 4/14 - HW 7, code generation: data types and implementation
  25. W 4/16 - Code generation for control structures (Ch 6.6)
  26. F  4/18 - Control structures: avoiding extra jumps, if, statement lists
  27. M 4/21 - No class
  28. W 4/23 - HW 8, control structures: while, return
  29. F  4/25 - Introduction to LR(1) parsing, First and Follow, SLR(1) parsing (Ch 4.4.2, 4.6.3-4)
  30. M 4/28 - LR(1) parsing (Ch 4.7)
  31. W 4/30 - LALR parsing, code generation for function calls (Ch 4.7; notes on LR(1) parsing)
  32. F  5/2 - Code generation for functions, HW 9, intro to optimization
  33. M 5/5 - Optimization, common subexpression elimination (CSE) (Ch 8.4-11, 9.1)
  34. W 5/7 - Global CSE, data flow analysis (Ch 9.2)
  35. F  5/9 - Global CSE, course summary, exam info (notes on optimization)

Resources on C and Assembly: