2014compiler课件Ch6_1章节.pptVIP

Compiler Samuel2005@126.com Chapter 6 Semantic Analysis Attributes Attributes Attribute is any property of a programming language construct. Attributes can vary widely in the information they contain, their complexity, and the time during the translation/execution process when they can be determined. Examples of attributes: The data type of a variable The value of an expression The location of a variable in memory The object code of a procedure The number of significant digits in a number Binding The process of computing an attribute and associating its computed value with the language construct is referred to as the binding of the attribute. The time during the compilation/execution process when the binding occur is called its binding time. Attributes that can be bound prior to execution are called static. Attributes that can only be bound during execution are dynamic. Attribute Grammars In syntax-directed semantics, attributes are associated directly with the grammar symbols of the language. If X is a grammar symbol, and a is an attribute associated to X, then we write X.a as the value of a associated to X. For each grammar rule X0-X1 X2…Xn, the values of attributes Xi.aj of each grammar symbol Xi are related. Attribute equation or semantic rule: Xi.aj = fij(X0.a1, …, X0.ak, X1.a1, …, X1.ak, …, Xn.a1, …, Xn.ak) Attribute grammar for the attributes a1, a2, …, ak is the collection of such equations for all grammar rules of the language Example 1 number - number digit | digit digit - 0 | 1| 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 Example 2 exp- exp + term | exp – term | term term-term * factor | factor factor-(exp) | number Example 3 decl-type var-list type- int | float var-list- id , var-list | id Dependency Graph Given an attribute grammar, each grammar rule choice has an associated dependency graph. The graph has a node labeled by each attribute of each symbol in the grammar rule. For each attribute equation Xi.aj = fij(…Xm.ak…) there is an edge from each node X