cp1 东南大学编译原理.ppt

In the process of translating a source program into a target code, a compiler may construct one or more intermediate representations (IRs), having a variety of forms. Syntax trees: commonly used during syntax and semantic analysis After syntax and semantic analysis, compilers generate an explicit lower-level or machine-like IR, a program for an abstract machine. Three-address code Intermediate Code Generation Code Optimization The machine-independent code optimization phase attempts to improve the intermediate code so that better target code will result. The code generator takes as input an intermediate representation of the source program and maps it into the target language. If the target language is machine code, registers or memory locations are selected for each of the variables used by the program. Then the intermediate instructions are translated into sequence of machine instructions that perform the same task. Code Generation Shared by later phases Allow to find the record for each identifier quickly and to store or retrieve data from the table quickly Symbol-Table Management Record the identifiers used in the source program and collect information about various attributes of each identifier, such as its type, its scope A symbol table is a data structure containing a record for each identifier, with fields for the attributes of the identifier The syntax and semantic analysis phases usually handle a large fraction of the errors detectable by the compiler Error Detection and Reporting Parser generators: Produce syntax analyzers, normally from input that is based on a context-free grammar Scanner generators: Automatically generate lexical analyzers, normally from a specification based on regular expression Compiler-Construction Tools Zhang Zhizheng seu_zzz@ School of Computer SciEng, SEU Compiling Principles Compiler Construction ? A.V Aho,Ravi Sethi, J.D Ullman, Compilers: Principles,Techniques,and Tools,人民邮电出版社，2002 (中译本：编译原理，李建中、姜守旭，机械工业出版社，2003) 秦