Date

Topic

Notes

Due

6/1

Intro to compilers, Racket language

• What is a Compiler?

• From OCaml to Racket

P1

6/2

Assembly, first compiler

• a86: a Little Assembly Language

• Abscond: a language of numbers

P2

6/3

Unary primitives, control flow

• Blackmail: incrementing and decrementing

• Con: branching with conditionals

6/4

Disjoint datatypes, I/O, system calls, ABI

• Dupe: a duplicity of types

• Dodger: addressing a lack of character

• Evildoer: change the world a couple nibbles at a time

A1

6/5

Errors, type tag checking

Extort: when errors exist

6/8

Binding and variables, run-time stack, compile-time environment

Fraud: local binding, variables, and binary operations

6/9

Binary operations

Fraud: local binding, variables, and binary operations

A2

6/10

Inductive data, memory allocation, pointer values

Hustle: heaps and lists

6/11

Inductive data, memory allocation, pointer values

Hustle: heaps and lists

A3

6/12

Exam, no lecture

E1

6/15

Array data, pointer offsets, mutation

Hoax: vectors and strings

A4

6/16

Function definitions and calls

Iniquity: function definitions and calls

6/17

Function definitions and calls

Iniquity: function definitions and calls

6/18

Tail calls

Jig: jumping to tail calls

A5

6/19

Juneteenth Holiday, no lecture

6/22

No class, A/C outage

Loot: lambda the ultimate

A6

6/23

Lambda

Loot: lambda the ultimate

6/24

Pattern matching, interpretation

Knock: pattern matching

6/25

Pattern matching, compilation

Knock: pattern matching

A7

6/26

Exam, no lecture

E2

6/29

Symbols, static and dynamic interning

Mug: symbols and interned string literals

A8

6/30

Compound static data

Mountebank: quote and compound static data

7/1

Structures

Neerdowell: structures

7/2

Source transformations

7/3

Independence Day Holiday, no lecture

7/6

Peephole optimizations

A8

7/7

Garbage collection

7/8

Self-hosting

Outlaw: self-hosting

7/9

Conclusion

A9

7/10

Exam, no lecture

E3