• 代码生成器的设计 • 目标语言 • 目标代码中的地址 • 基本块和流图 • 基本块优化 • 代码生成器 • 寄存器分配

• 使用上下文无关文法引导语言的翻译 – CFG的非终结符号代表了语言的某个构造 – 程序设计语言的构造由更小的构造组合而成 – 一个构造的语义可以由小构造的含义综合而来 • 比如：表达式x + y的类型由x、y的类型和运算符+决定 – 也可以从附近的构造继承而来 • 比如：声明int x中x的类型由它左边的类型表达式决定

一、LRSM给出了所有的可归活前缀 二、LRSM中的每个状态将对应一个饱和项目集： （1）其中一部分是由先驱状态分出来(称为基本项目)； （2）一部分则是由基本项目扩展出来的(称为扩展项目或派生项目)。派生部分项目的特点是其中的

A.1 Introduction A-3 A.2 Assemblers A-10 A.3 Linkers A-18 A.4 Loading A-19 A.5 Memory Usage A-20 A.6 Procedure Call Convention A-22 A.7 Exceptions and Interrupts A-33 A.8 Input and Output A-38 A.9 SPIM A-40 A.10 MIPS R2000 Assembly Language A-45 A.11 Concluding Remarks A-81 A.12 Exercises A-82

一、开始符产生式的右部是归约活前缀。 二、如果A是归约活前缀，且A→是产生式，则也是归约活前缀

A bottom-up parser uses an explicit stack to perform a parse – The parsing stack contains tokens, nonterminals as well as some extra state information – The stack is empty at the beginning of a bottom-up parse, and will contain the start symbol at the end of a successful parse

The idea of Recursive-Descent Parsing Viewing the grammar rule for a non-terminal A as a definition for a procedure to recognize an A The right-hand side of the grammar for A specifies the structure of the code for this procedure The Expression Grammar:

Special Notations for Repetitive Constructs Repetition – A → A  |  (left recursive), and – A →  A |  (right recursive) where  and  are arbitrary strings of terminals and non-terminals, and – In the first rule  does not begin with A and

高级程序员级软件基础知识试题覆盖面宽，有一定的理论深度，需要考生全面系统地掌 握大纲所规定的内容。数据结构、操作系统、程序语言、软件工程是考核的重点。二叉树、 图、存储管理、编译原理、软件设计方法等知识点考查的次数比较多，应当是重点中的重点

Symbol table: major inherited attribute and major data structure in a compiler Principal operations: – Insert: store the information provided by name declarations when processing these declarations – Lookup: retrieve the information associated to a name when that name is used in the associated code