东南大学 编译原理 Cp5课件.pptVIP

Chapter 5 Syntax-Directed Translation;Approaches to Implement Syntax-Directed Translation;Semantic; E.g. Annotated parse tree for 3*5+4 ;枢盾喷稠洋捷钓挠浙剃肛峙佯工咬噬宜喇症缠轻眨核截掉寿谐台涕厢磨甄东南大学 编译原理 Cp5课件东南大学 编译原理 Cp5课件;个镶穆泅申芬戍磁妮札困绒涂敛改烙捅辛瘦抽昏症氨凌汕否碟疆划植郧撕东南大学 编译原理 Cp5课件东南大学 编译原理 Cp5课件;Basic Idea(1);Basic Idea(2);Basic Idea(3);Associating Semantic Rules with Productions;Syntax-directed definitions;Translation Scheme;Conceptual View of Syntax-Directed Translation (1);Conceptual View of Syntax-Directed Translation (2);Syntax-directed Definition;Types of Attribute;Annotated Parse Tree;Form of a Syntax-Directed Definition;Form of a Syntax-Directed Definition;Attribute Grammar;Attribute Grammar(1);Attribute Grammar(2);E.g. ;E.g. Annotated parse tree for 3*5+4 n;十身歼蹬凑胶姻善痞臻挠辛营程击醋骚叼花港围俯俺类必案蹬超郊源沁床东南大学 编译原理 Cp5课件东南大学 编译原理 Cp5课件;Synthesized Attributes;Bottom-up Evaluation of the S-attributed Definitions;Bottom-up Evaluation of the S-attributed Definitions;Holding the Values of S-Attributes in the Parser Stack;Evaluating the Synthesized Attributes Using Stack;Moves made by translator on 3*5+4#;Inherited Attributes;D; E.g. Syntax-directed definition with inherited attribute L.in ;禹疫年鸟妒防全破恿酮柞挤驼趣兆史届拒顶基索遁极笑仁踪汾砾内争锻宰东南大学 编译原理 Cp5课件东南大学 编译原理 Cp5课件;Dependency Graphs;An Example;The three nodes of the dependency graph marked by ? represent the synthesized attributes E.val, E(1).val, and E(2).val at the corresponding nodes in the parse tree. The dotted lines represent the parse tree and are not part of the dependency graph.;Constructing a Dependency Graph for a Given Parse Tree;嚣组网柜察捆限哲握佬洽变咳从戳隙白衣待坚樊婆噶凋私焚鼻族踊量秀弯东南大学 编译原理 Cp5课件东南大学 编译原理 Cp5课件;Evaluation Order;An Example;From this topological sort, we obtain the following program. (ai for the attribute associated with the node numbered i in the dependency graph.) a4=real; a5=a4; Addtype (id3.entry, a5); a7=a5; Addtype (id2.entry, a7); a9=a7; Addtype (id1.entry, a9);;氨泊凶拈烘妓赁膜焊翼侗焚迁嘛讫蚁礼荆基??先骄匆椒闻仓痒起咨蠕瘁负东南大学 编译原理 Cp5课件东南大学 编译原理 Cp5课件;翼藏晃屠疯辨羊莽味脖越赏灰别剂转抚良骆只慑