CS 5641: Compiler Design

Lecturer: Rich Maclin (rmaclin)

Teaching Assistant: Kedar Bhumkar

Syllabus

Grades

Documentation:

• gdb
• flex
• bison

Class Materials:

• Introduction
  • Parts of a Compiler, Types of Programming Languages
• Lexical Analysis
  • Introduction, Finite State Machines
  • Regular Expressions, NFSMs, DFSMs, Translation
  • Scanner Implementation   Sample code (gziped tar file)
• Parsing
  • Introduction, Context Free Grammars, Languages, Derivations
  • Ambiguity, Precedence, Associativity
  • Top Down Parsing, Recursive Descent, Predictive Parsing, LL(1), First and Follow sets
  • Bottom Up Parsing, Shift and Reduce, Conflicts
  • SLR Parsing, SLR States   (PDF, 6 Per Page)
  • Constructing SLR States, LR(1) Parsing, LALR Parsing
• Semantic Analysis
  • Syntax-Directed Translation, Parse Trees, Abstract Syntax Trees
  • Implementation Example with Bison, LL(1) Grammar   Code for a simple bison and corresponding LL(1) parser
  • Scoping
  • Parameter Passing
  • Symbol Table Implementation
  • Type Checking
• Interpreters
• Code Generation
  • Memory Management
  • Code Generation I (note that the class presentation of the remaining topics is different from these notes)
  • Code Generation II
  • Local Optimization

Project Parts:

Teams

1. Project Part 1: A String Table
2. Project Part 2: Two Scanners
3. Project Part 3: The Parser
4. Project Part 4: Symbol Table and Type Checking
5. Project Part 5: The Interpreter

Homework Assignments:

1. Homework 1
2. Homework 2
3. Homework 3
4. Homework 4
5. Homework 5

Sample Exam Questions:

• Sample Questions for Midterm 1
• Sample Questions for Midterm 2
• Sample Questions for the Final or Midterm 3

C++ Notes (from 1622/1521) based on Learning C++: A Hands-On Approach by Nagler

• Intro to C++
• C++ Input and Output
• C++ Other Features
• C++ Classes