2014compiler课件ch12new2007章节.pptVIP

samuel2005@126.com samuel2005@126.com Chapter 1 Introduction 1.4 Major Data Structures in A Compiler编译器中的主要数据结构 Major Data Structures in Compiler There is a strong interaction between the algorithms used by the phases of a compiler and the data structures that support these phases. Algorithms need to be implemented in efficient manner. The choice of data structures is important Tokens 记号 When a scanner collects characters into a token, it represents the token symbolically as a value of an enumerated data type representing a set of tokens of the source language Sometimes, it is necessary to preserve the character string itself or other information derived from it The name associated with an identifier token The value of a number token In most languages the scanner needs only to generate one token at a time (single symbol lookahead 单符号先行) A single global variable can be used to hold the token information. Tokens 记号 The Syntax Tree 语法树 The syntax tree is constructed as a standard pointer-based structure that is dynamically allocated as parsing proceeds. The tree can be kept as a single variable pointing to the root node. Each node is a record. Its fields represent the information collected by the parser and the semantic analyzer. Sometimes these fields are dynamically allocated The Syntax Tree 语法树 The Symbol Table 符号表 This data structure keeps information associated with identifiers: functions, variables, constants, and data types. The symbol table interacts with almost every phase of the compiler. The insertion, deletion ,and access operations need to be efficient. A standard data structure for this purpose is the hash table(杂凑表、哈希表). The Literal Table 常数表 Stores constants and strings used in the program. Quick insertion and lookup are essential. Need not allow deletions. Intermediate Code 中间代码 Depending on the kind of intermediate code and the optimization performed, it may be kept as An array of text strings A temporary text file A linked list of structu