Control-flow Graph (CFG)

Register Allocation

Static Single-assignment (SSA)

Basic Blocks

Instruction Selection

Middle End

Dataflow Analysis

Dataflow Theory

Lexing

Parsing

Typechecking

Static Semantics

Calling Conventions

Dynamic Semantics

Mutable Store

struct (C programming language)

Loops

Partial Redundancy Elimination

Locality

Instruction Scheduling

Alias Analysis

15-411 Compiler Design Carnegie Mellon University Fall 2020 Comprehensive study of compiler design and implementation, examining interaction between language design and runtime organization. Topics include program analysis, code generation, optimization, memory management. This course covers the design and implementation of compiler and runtime systems for high-level languages, and examines the interaction between language design, compiler design, and runtime organization. Topics covered include lexical and syntactic analysis, type-checking, program analysis, code generation and optimization, memory management, and runtime organization. - Distinguish the main phases of a state-of-the-art compiler
- Understand static and dynamic semantics of an imperative language
- Develop parsers and lexers using parser generators and combinators
- Perform semantic analysis
- Translate abstract syntax trees to intermediate representations and static single assignment form
- Analyze the dataflow in an imperative language
- Perform standard compiler optimizations
- Generate efficient assembly code for a modern architecture
- Allocate registers using a graph-coloring algorithm
- Understand opportunities and limitations of compiler optimizations
- Appreciate design tradeoffs how representation affects optimizations
- Automatically manage memory using garbage collection
- Develop complex software following high-level specifications  

15-411 Compiler Design

Compilers

Control-flow graph

Control-flow Graph (CFG)

1 courses cover this concept

15-411 Compiler Design