Presentation is loading. Please wait.

Presentation is loading. Please wait.

Code Generation Example -- 1 source text: x:=1; z := y < x Abstract Syntax Tree: ; := < x 1 z y x assignment = vars ‘:=‘ exprs; stmts = stmts ‘;’ stmt;

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "Code Generation Example -- 1 source text: x:=1; z := y < x Abstract Syntax Tree: ; := < x 1 z y x assignment = vars ‘:=‘ exprs; stmts = stmts ‘;’ stmt;"— Presentation transcript:

1 Code Generation Example -- 1 source text: x:=1; z := y < x Abstract Syntax Tree: ; := < x 1 z y x assignment = vars ‘:=‘ exprs; stmts = stmts ‘;’ stmt; relation = sum ‘<‘ sum; b logical i integer r real

2 Code Generation Example -- 2 source text: x:=1; z := y < x Abbreviate As stmts_stmtsSEMIstmt ; assignment_varsCOLONEQexprs := relation_sumLTsum < tree.getRoot() root() tree.getNode(nd,k) node(k)

3 Code Generation Example -- 3 source text: x:=1; z := y < x initial state: ; := < x 1 z y x symbol table y/right/i z/left/b x/leftright/i x86 code

4 Code Generation Example -- 4 source text: x:=1; z := y < x genWalk(): emit.prolog() ; := < x 1 z y x symbol table y/right/i z/left/b x/leftright/i 55: pushR EBP # save x86 frame pointer 89e5: movRR EBP,ESP # new x86 frame 8b7508: movRP ESI,8 # point at X frame 60:pushA # callee save 55 89e5 8b7508 60

5 Code Generation Example -- 5 source text: x:=1; z := y < x genWalk(): stmtWalk(getRoot()) ; := < x 1 z y x symbol table y/right/i z/left/b x/leftright/i 55 89e5 8b7508 60 x86 code

6 Code Generation Example -- 6 source text: x:=1; z := y < x stmtWalk(): assignWalk(getKid(1)) ; := < x 1 z y x symbol table y/right/i z/left/b x/leftright/i 55 89e5 8b7508 60 x86 code

7 Code Generation Example -- 7 source text: x:=1; z := y < x assignWalk(): lhs=varsWalk(getKid(1)) ; := < x 1 z y x symbol table y/right/i z/left/b x/leftright/i 55 89e5 8b7508 60 x86 code

8 Code Generation Example -- 8 source text: x:=1; z := y < x varsWalk(): opd=emit.var(tok) ; := < x 1 z y x symbol table y/right/i z/left/b x/leftright/i 55 89e5 8b7508 60 x86 code

9 Code Generation Example -- 9 source text: x:=1; z := y < x assignWalk(): rhs=exprsWalk(getKid(3)) ; := < x 1 z y x symbol table y/right/i z/left/b x/leftright/i lhs x 55 89e5 8b7508 60 x86 code

10 Code Generation Example -- 10 source text: x:=1; z := y < x exprsWalk(): t=exprWalk(getKid(1)) ; := < x 1 z y x symbol table y/right/i z/left/b x/leftright/i lhs x 55 89e5 8b7508 60 x86 code

11 Code Generation Example -- 11 source text: x:=1; z := y < x exprWalk(): opd=emit.expr0(rule,tok) ; := < x 1 z y x symbol table y/right/i z/left/b x/leftright/i lhs rhs 1 x 55 89e5 8b7508 60 x86 code

12 Code Generation Example -- 12 source text: x:=1; z := y < x assignWalk(): emit.store(lhs, rhs) ; := < x 1 z y x symbol table y/right/i z/left/b x/leftright/i 55 89e5 8b7508 60 b801000000 89860000000 lhs x rhs1 b801000000: movRC EAX,=1=0x1 898600000000: movMR 0,EAX (x)

13 Code Generation Example – 13 source text: x:=1; z := y < x stmtWalk(): stmtWalk(getKid(2)) ; := < x 1 z y x symbol table y/right/i z/left/b x/leftright/i 55 89e5 8b7508 60 b801000000 89860000000 x86 code

14 Code Generation Example – 14 source text: x:=1; z := y < x stmtWalk(): assignWalk(getKid(3)) ; := < x 1 z y x symbol table y/right/i z/left/b x/leftright/i x86 code 55 89e5 8b7508 60 b801000000 89860000000

15 Code Generation Example – 15 source text: x:=1; z := y < x assignWalk(): lhs =varsWalk(getKid(1)) ; := < x 1 z y x symbol table y/right/i z/left/b x/leftright/i x86 code 55 89e5 8b7508 60 b801000000 89860000000

16 Code Generation Example – 16 source text: x:=1; z := y < x varsWalk(): opd=emit.var(tok) ; := < x 1 z y x symbol table y/right/i z/left/b x/leftright/i x86 code 55 89e5 8b7508 60 b801000000 89860000000

17 Code Generation Example – 17 source text: x:=1; z := y < x assignWalk(): rhs =exprsWalk(getKid(3)) ; := < x 1 z y x symbol table y/right/i z/left/b x/leftright/i x86 code lhs z 55 89e5 8b7508 60 b801000000 89860000000

18 Code Generation Example – 18 source text: x:=1; z := y < x exprWalk(): lft=exprWalk(getKid(1)) ; := < x 1 z y x symbol table y/right/i z/left/b x/leftright/i x86 code lhs z 55 89e5 8b7508 60 b801000000 89860000000

19 Code Generation Example – 19 source text: x:=1; z := y < x exprWalk(): res=emit.expr0(tok) ; := < x 1 z y x symbol table y/right/i z/left/b x/leftright/i x86 code lhs z 55 89e5 8b7508 60 b801000000 89860000000

20 Code Generation Example – 20 source text: x:=1; z := y < x exprWalk(): rgt=exprWalk(getKid(3)) ; := < x 1 z y x symbol table y/right/i z/left/b x/leftright/i x86 code lhs z lft y 55 89e5 8b7508 60 b801000000 89860000000

21 Code Generation Example – 21 source text: x:=1; z := y < x exprWalk(): res = emit.expr0(r, tok) ; := < x 1 z y x symbol table y/right/i z/left/b x/leftright/i x86 code lhs z y lft 55 89e5 8b7508 60 b801000000 89860000000

22 Code Generation Example – 22 source text: x:=1; z := y < x exprWalk(): emit.expr2(rule,lft,rgt) ; := < x 1 z y x symbol table y/right/i z/left/b x/leftright/i lhs z lft rgt y x 8b8608000000 8b8e00000000 3bc1 8b8608000000: movRM EAX,8 (y) 8b8e00000000: movRM ECX,0 (x) 3bc1: cmpRR EAX,ECX 55 89e5 8b7508 60 b801000000 89860000000

23 Code Generation Example – 23 source text: x:=1; z := y < x assignWalk(): emit.store(lhs,rhs) ; := < x 1 z y x symbol table y/right/i z/left/b x/leftright/i lhs z rhs F 0f9cc0: setlR EAX 81e001000000: andRC EAX,=1=0x1 898604000000: movMR 4,EAX (z) 8b8608000000 8b8e00000000 3bc1 0f9cc0 81e001000000 898604000000 55 89e5 8b7508 60 b801000000 89860000000

24 Code Generation Example – 24 source text: x:=1; z := y < x stmtWalk(): ; := < x 1 z y x symbol table y/right/i z/left/b x/leftright/i 8b8608000000 8b8e00000000 3bc1 0f9cc0 81e001000000 898604000000 55 89e5 8b7508 60 b801000000 89860000000 x86 code

25 Code Generation Example – 25 source text: x:=1; z := y < x genWalk(): emit.epilog() ; := < x 1 z y x 8b8608000000 8b8e00000000 3bc 0f9cc0 81e001000000 898604000000 61 33C0 c9 c3 61: popA # callee restore 33C0: xorRR EAX,EAX # 0 means no error c9: leave # restore stack c3: ret # restore EIP 55 89e5 8b7508 60 b801000000 89860000000

Download ppt "Code Generation Example -- 1 source text: x:=1; z := y < x Abstract Syntax Tree: ; := < x 1 z y x assignment = vars ‘:=‘ exprs; stmts = stmts ‘;’ stmt;"

Similar presentations

Calling sequence ESP.

Calling sequence ESP.
Chapter 8 Intermediate Code Generation. Intermediate languages: Syntax trees, three-address code, quadruples. Types of Three – Address Statements: x :=

Chapter 8 Intermediate Code Generation. Intermediate languages: Syntax trees, three-address code, quadruples. Types of Three – Address Statements: x :=
1 Homework / Exam Turn in mp2 at start of class today Reading –PAL, pp 3-6, 361-367 Exam #1 next class –Open Book / Open Notes –NO calculators or other.

1 Homework / Exam Turn in mp2 at start of class today Reading –PAL, pp 3-6, Exam #1 next class –Open Book / Open Notes –NO calculators or other.
Assembly Language for Intel-Based Computers Chapter 8: Advanced Procedures Kip R. Irvine.

Assembly Language for Intel-Based Computers Chapter 8: Advanced Procedures Kip R. Irvine.
University of Washington Last Time For loops  for loop → while loop → do-while loop → goto version  for loop → while loop → goto “jump to middle” version.

University of Washington Last Time For loops  for loop → while loop → do-while loop → goto version  for loop → while loop → goto “jump to middle” version.
Syntax Trees MathWorks Compiler Course – Day 5. Syntax Trees MathWorks Compiler Course – Day 5 Parser lexemes shift/reduce seq. Cfg tables Tree Symbols.

Syntax Trees MathWorks Compiler Course – Day 5. Syntax Trees MathWorks Compiler Course – Day 5 Parser lexemes shift/reduce seq. Cfg tables Tree Symbols.
Machine-Level Programming III: Procedures Apr. 17, 2006 Topics IA32 stack discipline Register saving conventions Creating pointers to local variables CS213.

Machine-Level Programming III: Procedures Apr. 17, 2006 Topics IA32 stack discipline Register saving conventions Creating pointers to local variables CS213.
Assembly Language for Intel-Based Computers Chapter 5: Procedures Kip R. Irvine.

Assembly Language for Intel-Based Computers Chapter 5: Procedures Kip R. Irvine.
ISBN 0-321-19362-8 Chapter 3 More Syntax –BNF –Derivations –Practice.

ISBN Chapter 3 More Syntax –BNF –Derivations –Practice.
1 Lecture 5: Procedures Assembly Language for Intel-Based Computers, 4th edition Kip R. Irvine.

1 Lecture 5: Procedures Assembly Language for Intel-Based Computers, 4th edition Kip R. Irvine.
1 Function Calls Professor Jennifer Rexford COS 217 Reading: Chapter 4 of “Programming From the Ground Up” (available online from the course Web site)

1 Function Calls Professor Jennifer Rexford COS 217 Reading: Chapter 4 of “Programming From the Ground Up” (available online from the course Web site)
Accessing parameters from the stack and calling functions.

Accessing parameters from the stack and calling functions.
Practical Session 3. The Stack The stack is an area in memory that its purpose is to provide a space for temporary storage of addresses and data items.

Practical Session 3. The Stack The stack is an area in memory that its purpose is to provide a space for temporary storage of addresses and data items.
– 1 – 15-213, F’02 ICS05 Instructor: Peter A. Dinda TA: Bin Lin Recitation 4.

– 1 – , F’02 ICS05 Instructor: Peter A. Dinda TA: Bin Lin Recitation 4.
Microprocessors Frame Pointers and the use of the –fomit-frame-pointer switch Feb 25th, 2002.

Microprocessors Frame Pointers and the use of the –fomit-frame-pointer switch Feb 25th, 2002.
Chapter 2 A Simple Compiler

Chapter 2 A Simple Compiler
September 22, 2014 Pengju (Jimmy) Jin Section E

September 22, 2014 Pengju (Jimmy) Jin Section E
Stack Activation Records Topics IA32 stack discipline Register saving conventions Creating pointers to local variables February 6, 2003 CSCE 212H Computer.

Stack Activation Records Topics IA32 stack discipline Register saving conventions Creating pointers to local variables February 6, 2003 CSCE 212H Computer.
Web siteWeb site ExamplesExamples Irvine, Kip R. Assembly Language for Intel-Based Computers, 2003. 1 Stack Operations Runtime Stack PUSH Operation POP.

Web siteWeb site ExamplesExamples Irvine, Kip R. Assembly Language for Intel-Based Computers, Stack Operations Runtime Stack PUSH Operation POP.
Recitation 2: Assembly & gdb Andrew Faulring 15213 Section A 16 September 2002.

Recitation 2: Assembly & gdb Andrew Faulring Section A 16 September 2002.

Similar presentations

Ads by Google