Homework

Homeowrk #12, due 4/28/06: Exercises 13.2, 13.6, 13.8, 14.7, 14.10
Homework #11, due 4/21/06: Exercises 12.1, 12.3, 12.6, 12.11
Homework #10, due 4/14/06: Exercises 10.3, 11.1, 11.3, 11.4, 11.8
Homework #9, due 4/7/06: Exercises 9.2, 9.4, 9.5
Homework #8, due 3/30/06: Exercises 8.1, 8.4, 8.8, 8.9
Homework #7, due 3/24/06: Exercises 5.6, 6.1, 6.6, 6.10, 7.1 7.6, 7.8, 7.13
Homework #6, due 3/3/06: Exercises 5.1, 5.2, and 5.3
Homework #5, due 2/24/06:
1. Assuming left-associativity, and giving precedence to * over +, draw AST's for the following expression:
```
    1 + 2 * ( 3 + 4 + 5) * 6
```
2. Pretend that you need a native C++ to PowerPC (PPC) compiler, and that you have:
  - the C source code for a C++ to PPC compiler,
  - the C source code for a C to PPC compiler,
  - a native C to ia32 compiler, and
  - a machine implementing the ia32 architecture
  (a) Please describe how you would bootstrap the native C++ to PowerPC compiler.
  (b) Use T-Diagrams to graphically represent this process.
  (A native compiler is ones whose target and implementation languages are the same.)
3. Write a Lisp or Scheme S-expression that evaluates to itself. (Hint: Think about how (λx.xx) (λx.xx) reduces infinitely, but write an expression that results in a Lisp list that contains the code for itself (using quote, cons, list, etc. as necessary).

Homework #4, due 2/17/06:

Solve Exercises 4.1, 4.2, and 4.4 in the text book.

Tell me whether the grammar:

  <e> ::= <t> + <e>
         | <t> - <e>
         | <t>
  <t> ::= <f> * <t>
         | <f> / <t>
         | <f>
  <f> ::= ( <e> ) | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10

implements the standard rules of

(a) precedence (for multiplication over addition) and
(b) left-associativity (within precedence levels):

Homework #3, due 2/10/06: Exercises 4.3, 4.5, 4.6, and 4.7
Homework #2, due 2/3/06: Exercises 3.1, 3.4, 3.5, and 3.6
Homework #1, due 1/27/06: Exercises 2.1, 2.2, 2.3, and 3.2

CS 3723: Programming Languages

Homework