UCLA Computer Science 132, Winter 2006.
Compiler Construction

Course objective: Provide a thorough elementary coverage of compiler theory and design, using a careful balance between basic principles and specific techniques.

• News
• Syllabus
• Homework
• Grading

Instructor: Paul Eggert <eggert@cs.ucla.edu>, Boelter 4532J, office hours Mondays and Tuesdays from 14:00 to 15:00.

Teaching assistants, in Boelter 4428:

• Krztsztof Rutkowski <kjrutkow>, office hours TBA.
• Terrence Tong <tmtong>, office hours TBA.

Please append @cs.ucla.edu to the email addresses above.

Lecture, 4 hours; discussion, 2 hours; outside study, 6 hours.

Prerequisites: Computer Science 32, 131, 181.

Compiler structure; lexical and syntactic analysis; semantic analysis and code generation; theory of parsing. Letter grading.

Related IEEE/ACM Computing Curricula 2001 (CC2001) bodies of knowledge:

• PL2. Virtual machines
• PL3. Introduction to language translation
• PL8. Language translation systems

Related IEEE/ACM Software Engineering 2004 (SE2004) bodies of knowledge:

• CMP.ct.7 State-based and table driven construction techniques
• CMP.ct.9 Grammar-based input processing (parsing)
• FND.mf.7 Finite State Machines, regular expressions
• FND.mf.8 Grammars