CSE411 Syllabus

CSE411 Introduction to Compilers

Course Information

Instructor: Jooyong Yi (jooyong AT <unist domain>)
TAs
- Nguyễn Gia Phong (mcsinyx AT <unist domain>)
Office Hours: by appointment

References (not a textbook)

Lecture slides will be provided.
Compilers: Principles, Techniques, and Tools 2nd Edition
Modern Compiler Implementation in ML
A free online textbook by Douglas Thain

Grading

Individual assignments: 40%
Final exam: 40%
Attendance and participation: 20%

Assignments

You will implement a compiler for a simple Java-like language. Specifically, you will build various components of a compiler such as:
1. Lexer and Parser
2. AST (Abstract Syntax Tree) builder
3. Type Checker
4. Code generator

Assignment Policy

No late submission is allowed.
No plagiarism is allowed. Anyone who violates the policy will receive 0 points for the entire assignment.

Basic Compiler Architecture

Schedule (tentative)

Week	Lecture
1	Overview
2	Lexing, Introduction to Parsing
3	Parsing Algorithms, Recursive Descent Parsing
4	Predictive Parsing
5	Bottom-Up Parsing
6	SLR, LR(0), LR(1) and LALR(1), LL() and ALL()
7	Abstract Syntax Tree
8	Midterm week
9	Type Checking
10	Type Inference, Intermediate Representation
11	Code Generation, Register Allocation
12	Liveness Analysis, Reaching Definitions
13	Data-flow Analysis, Loop Optimization
14	Interval Analysis
15	Wrap-Up