Compiler Design

AUTOMATA THEORY

Lecture notes will be available in either postscript or pdf format.

• For files that are in postscript format, you need a postscript previewer. You should be able to view them on the SparcStations. If you want to print them, while viewing them, select "save" and save as a file with a ".ps" extension, for example: lect1.psYou can then send the file to the printer by typing: lpr lect1.ps
• To read PDF files you can download the free Adobe Acrobat Reader.

Lecture Notes

• Overview (ps and pdf ) Jan. 19 and 21
• Finite Automata (ps and pdf ) Jan. 26
• Regular Expressions and Regular Grammars (ps and pdf ) Jan. 28 and Feb. 2
• Pumping Lemma (ps and pdf ) Feb. 4 and Feb. 9
• Minimizing DFA (ps and pdf ) Feb. 9
• Context-free grammars(ps and pdf ) Feb. 11
• Transforming Grammars (ps and pdf ) Feb. 16
• Pushdown Automata (ps and pdf ) Feb. 16 and 18
• Parsing (ps and pdf ) Mar. 2
• LR Parsing (ps and pdf ) Mar. 4 and 9
• LL Parsing (ps and pdf ) Mar. 11
• Properties of CFL (ps and pdf ) Mar. 23 and 25
• Turing Machines (ps and pdf ) Mar. 30
• Turing Machines as Building Blocks (ps and pdf ) April 1
• Turing Machines (ps and pdf ) April 6 and 8
• Recursively Enumerable (ps and pdf ) April 15 and 20
• L-Systems (ps and pdf ) April 20
• Decidability (ps and pdf ) April 27
• Compilers (ps and pdf ) April 29 

Compilers Design PDF

Programming Languages

and Compilers

Download :

Class	Topic	Lecture slides (pdf)
1	Introduction to course; intro to OCaml	lecture 1 (ann) ,lecture1.ml
2	Ocaml - tuples and lists	lecture 2(lecture 2 (ann)) (Supplementary notes for lecture 2)
3	OCaml - type definitions, abstract syntax	lecture 3(lecture 3 (ann))
4	Language implementation overview	lecture 4 (v. 2)(supplementary notes)
5	Lexical analysis	lecture 5(lecture 5 with annotations from today and 2/6)
6	Regular expressions, Ocamllex	lecture 6(lecture 6 annotated)
7	Parsing - context-free grammars, recursive descent parsing	lecture 7(lecture 7 ann) (Code from lecture: 1, 2, 3,1b, 2b, 3b, 3c)
8	Top-down parsing	lecture 8 (ann)(lecture 8 addendum)
9	Bottom-up (shift/reduce) parsing	lecture 9(lecture 9 ann)
10	LR parsing - conflict resolution	lecture 10(lecture 10 ann) (supplement to lecture 10) (The LR theorem)
	Review for midterm 1 (optional)	Review questions(solutions)
	Midterm 1 - 180 Bevier Hall, 7-8:30PM	exam solution
11	Code generation	lecture 11
12	Code generation (cont.)	lecture 12(lecture 12 ann)
13	Garbage collection; run-time systems for dynamic languages	lecture 13 (6up)
14	History of programming languages	lecture 14(lecture 14 ann)
15	APL	lecture 15(lecture 15 ann)
16	Functional programming: higher-order functions	lecture 16 (ann)
17	More higher-order functions	lecture 17(lecture 17 ann) (supp. notes on dynamic scope)
	Spring break
18	Even more higher-order functions	lecture 18(lecture 18 ann)
19	Functional programming in o-o languages	lecture 19
20	Review for midterm 2 (optional)	sample questions(solutions) (12:30 review notes) (2:00 review notes)
	Midterm 2 - 151 Everitt Lab, 7-8:30PM	Midterm solutions
21	Inference systems; formalizing operational semantics	lecture 21(lecture 21 ann)
22	Type systems	lecture 22 (ignore pages 18-22) (proof trees for examples)
23	Operational semantics	lecture 23 (2-up) (6-up) (Two examples) (handout) (yet another example)
24	Hoare logic for imperative languages	lecture 24(lecture 24 ann)
25	Hoare logic for imperative languages	lecture 25 (ann), fibonacci number example
26	Advanced topics: Lazy evaluation; lambda-calculus	lecture 26(lecture 26 ann)
27	Advanced topics: functional programming for parallelism	lecture 27
28	Wrap-up; review for final; preview of follow-up courses	For review:sp08-final.pdf(solution) - see below. And Spring 08 sample questions(solutions) - see below. And slides fromvideotaped problem session