Compiler Principles

Prerequisites

• Discrete mathematics, data structures, and systems programming.
• Familiarity with at least one typed or scripting language.
• Ability to read recursive algorithms and basic formal-language material.

Learning Outcomes

• Implement lexing, parsing, and semantic checks.
• Design an intermediate representation and basic optimizations.
• Generate executable or interpretable target code.
• Understand types, scope, control flow, and data flow.
• Apply compiler techniques to static checks and security tools.

Course Format

• Two meetings per week: one for core concepts and one for labs, paper discussion, or project review.
• The course proceeds over 16 weeks, each with a checkable assignment, lab, or project milestone.
• Reproducibility is required: code, configuration, data, lab logs, and reports must be reviewable by staff or peers.

Weekly Plan

Assessment

Course Project

Students build a small compiler in stages and add a final extension such as a type feature, optimization, interpreter, diagnostics, or security lint.

Policies

• AI tools are allowed, but generated code, lab notes, and design suggestions must be reviewed by the student and disclosed in the report.
• Students may not submit code, proofs, configuration, or experimental results they cannot explain; each member must defend their own design, tests, and tradeoffs.
• Late work affects iteration grades, but the course values reproducible, auditable, and maintainable results over last-minute accumulation.