CS 131 Reading Assignments

R 1: Intro, Compilers and Interpreters

• Due: Monday, January 27, 2003
• Read: the SML Overview handout and Scott pp. 1-25.
• Bring to class: Answers to Exercise 1.2 (page 27).
  [Actually, the question here is misleading; these days Lisp code is "mostly-compiled", and other functional languages are often fully compiled.]

R 2: Lexing

• Due: Monday, February 3
• Read: Scott pp. 31-45, 250-253
• Key Ideas: regular expressions, tokens, grammars, ambiguity
• Bring to class: A regular expression (involving characters, |, *, etc.) that matches all and only C integer constant values according to the handout from Kernighan and Ritchie; this should not be in the form of a general context-free grammar.

R 3: Parsing

• Due: Monday, February 10
• Read: Scott pp. 48-57, 68-71
• Bring to class: At least two reasons why the C grammar in the Kernighan and Ritchie handout is not LL(1).

R 4: Control Flow

• Due: Monday, February 17
• Read: Scott pp. 254-287
• Bring to class: an answer to Review Question 6.19 (page 311).

R 5: Parameter Passing

• Due: Monday, February 24
• Read: Scott pp. 297-303 and 427-459
• Bring to class: answers to Review Question 8.13 (page 485), and Exercise 8.9 (page 487).

R 6: Types

• Due: Monday, March 3
• Read: Scott pp. 319-330, 351-355, 382-391
• Bring to class: an answer to Review Question 7.21 (page 419).

R 7: Type Parameters

• Due: Monday, March 10
• Read: Scott pp. 144-149, 459-464
• Bring to class: yourself.

R 8: Other Paradigms

• Due: Monday, March 31
• Read: Scott pp. 303-308, 626-641
• Bring to class: an answer to Review Question 11.25 (page 650).

R 9: Semantics

• Due: Monday, April 7
• Read: Meyer handout
• Bring to class: A response to the question: Would Puzzle 1 have a solution in an "ideal" language?

R 10: Type Safety

• Due: Monday, April 21
• Read: Cyclone article
• Bring to class: a list of the three most important ideas in this paper.