Next: Contents

CSE 5317/4305: Design and Construction of Compilers

by Leonidas Fegaras
Department of Computer Science and Engineering
The University of Texas at Arlington
email: fegaras@cse.uta.edu
web: http://lambda.uta.edu/

Updated 26 August 2002

Contents
1 Introduction
2 Lexical Analysis
3 Parsing
4 Abstract Syntax
- 4.1 The Hard Way of Building Abstract Syntax Trees
- 4.2 Case Study: Abstract Syntax Trees for the Calculator Example
5 Semantic Actions
6 Semantic Analysis
7 Activation Records
- 7.1 Run-Time Storage Organization
- 7.2 Case Study: Activation Records for the MIPS Architecture
8 Intermediate Code
- 8.1 Translating Variables, Records, Arrays, and Strings
- 8.2 Control Statements
9 Basic Blocks and Traces
10 Instruction Selection
11 Liveness Analysis
12 Register Allocation
- 12.1 Register Allocation Using the Interference Graph
- 12.2 Code Generation for Trees
13 Garbage Collection
- 13.1 Storage Allocation
- 13.2 Automatic Garbage Collection
14 Functional Programming

Leonidas Fegaras
2002-08-26