Semantic analysis Parsing only verifies that the program consists of tokens arranged in a syntactically-valid combination, we now move on to semantic analysis, where we delve deeper to check whether they form a sensible set of instructions in the programming language

第9章符号表 9.1符号表的作用和地位 9.2符号的主要属性及作用 9.3符号表的组织

第十一章代码优化 11.1什么是代码优化 11.2局部优化 11.3控制流程分析和循环 11.4数据流分析举例

RUN-Time Organization Compiler phase- Before writing a code generator, we must decide how to marshal the resources of the target machine (instructions, storage, and system software) in order to implement the source language. This is called run-time organization

一、 自底向上分析的思想和主要问题 二、几种LR分析方法：

一、标识符、常量与变量 二、字串 三、运算符 四、控制结构 五、数组 六、结构化的编程原则

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

A stack-based environment will result in a dangling reference when the procedure is exited if a local variable in a procedure can be returned to the caller The simplest example:

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;