The document discusses code generation techniques in compiler construction. It describes generating executable code from source code by using intermediate representations like three-address code and P-code. It covers generating code from syntax trees, implementing intermediate codes using data structures, and translating between different intermediate representations and target machine code.

1. COMPILER CONSTRUCTION Principles and Practice Kenneth C. Louden

2. 8. Code Generation PART ONE

5. 8.1 Intermediate Code and Data Structures for Code Generation

6. 8.1.1 Three-Address Code

11. 8.1.2 Data Structures for the Implementation of Three-Address Code

16. 8.1.3 P-Code

20. 8.2 Basic Code Generation Techniques

21. 8.2.1 Intermediate Code or Target Code as a Synthesized Attribute

23. 1) P-Code The expression (x=x+3)+4 has the following P-Code attribute: Lda x Lod x Ldc 3 Adi Stn Ldc 4 Adi Factor  id factor.pcode=”lod”||id.strval Factor  num factor.pcode=”ldc”||num.strval Factor  (exp) factor.pcode=exp.pcode Aexp  factor aexp.pcode=factor.pcode Aexp1  aexp2 + factor aexp1.pcode=aexp2.pcode++factor.pcode++”adi” Exp  aexp exp.pcode=aexp.pcode Exp1  id = exp2 exp1.pcode=”lda”|| id.strval++exp2.pcode++”stn” Grammar Rule Semantic Rules

24. T1=x+3 x=t1 t2=t1+4 2) Three-Address Code Factor  id factor.namenum.strval; factor.tacode=” “ Factor  num factor.namenum.strval; factor.tacode=” “ Factor  (exp) factor.name=exp.name; factor.tacode=exp.tacode Aexp  factor aexp.name=factor.name; aexp.tacode=factor.tacode Aexp1  aexp2 + factor aexp1.name=newtemp( ) aexp1.tacode=aexp2.tacode++factor.tacode++ aexp1.name||”=”||aexp2.name||”+”||factor.name Exp  aexp exp.name=aexp.name; exp.tacode=aexp.tacode Exp1  id = exp2 exp1.name=exp2.name Exp1.tacode=exp2.tacode++ id.strval||”=”||exp2.name Grammar Rule Semantic Rules

25. 8.2.2 Practical Code Generation

34. 8.2.3 Generation of Target Code from Intermediate Code

42. End of Part One THANKS