Synta-Directed TranslationPart I.pptVIP

Syntax-Directed TranslationPart I Chapter 5 The Structure of our Compiler Revisited Syntax-Directed Definitions A syntax-directed definition (or attribute grammar) binds a set of semantic rules to productions Terminals and nonterminals have attributes holding values set by the semantic rules A depth-first traversal algorithm traverses the parse tree thereby executing semantic rules to assign attribute values After the traversal is complete the attributes contain the translated form of the input Example Attribute Grammar Example Annotated Parse Tree Annotating a Parse Tree With Depth-First Traversals Depth-First Traversals (Example) Attributes Attribute values may represent Numbers (literal constants) Strings (literal constants) Memory locations, such as a frame index of a local variable or function argument A data type for type checking of expressions Scoping information for local declarations Intermediate program representations Synthesized Versus Inherited Attributes Given a production Athen each semantic rule is of the form b := f(c1,c2,…,ck)where f is a function and ci are attributes of A and ?, and either b is a synthesized attribute of A b is an inherited attribute of one of the grammar symbols in ? Synthesized Versus Inherited Attributes (cont’d) S-Attributed Definitions A syntax-directed definition that uses synthesized attributes exclusively is called an S-attributed definition (or S-attributed grammar) A parse tree of an S-attributed definition is annotated with a single bottom-up traversal Yacc/Bison only support S-attributed definitions Example Attribute Grammar in Yacc Bottom-up Evaluation ofS-Attributed Definitions in Yacc Example Attribute Grammar with Synthesized+Inherited Attributes Acyclic Dependency Graphs for Parse Trees Dependency Graphs with Cycles? Edges in the dependency graph determine the evaluation order for attribute values Dependency graphs cannot be cyclic Example Annotated Parse Tree Example Annotated Parse Tree with Dependency Gr