8.1.1 Three-Address Code 8.1.2 Data Structures for theImplementation of Three-Address Code

南京大学：《编译原理 Principles and Techniques of Compilers》课程教学电子教案（实验讲义）实验四 目标代码生成

南京大学：《编译原理 Principles and Techniques of Compilers》课程教学电子教案（实验讲义）实验三 中间代码生成

南京大学：《编译原理 Principles and Techniques of Compilers》课程教学电子教案（实验讲义）实验二 语义分析

南京大学：《编译原理 Principles and Techniques of Compilers》课程教学电子教案（实验讲义）实验一 词法分析与语法分析

The memory of a typical computer: A register area; Addressable Random access memory (RAM): A code area; A data area. The code area is fixed prior to execution, and can be visualized as follows:

Attributes – Any property of a programming language construct such as The data type of a variable The value of an expression The location of a variable in memory

Function of a Parser Takes the sequence of tokens produced by the scanner as its input and produces the syntax tree as its output. Parser Sequence of tokens Syntax-Tree

Main Purpose Study an algorithm: – Translating a regular expression into a DFA via NFA

The Function of a Scanner Reading characters from the source code and form them into logical units called tokens Tokens are logical entities defined as an enumerated type – Typedef enum {IF, THEN, ELSE, PLUS, MINUS, NUM, ID,…} TokenType;