Presentation is loading. Please wait.

Presentation is loading. Please wait.

INTERMEDIATE LANGUAGES SUNG-DONG KIM DEPT. OF COMPUTER ENGINEERING, HANSUNG UNIVERSITY.

Published byJanel Lewis Modified over 8 years ago

Similar presentations

Presentation on theme: "INTERMEDIATE LANGUAGES SUNG-DONG KIM DEPT. OF COMPUTER ENGINEERING, HANSUNG UNIVERSITY."— Presentation transcript:

1 INTERMEDIATE LANGUAGES SUNG-DONG KIM DEPT. OF COMPUTER ENGINEERING, HANSUNG UNIVERSITY

2 1. INTRODUCTION (1)  Compiler model (2014-1) Compiler Source Program Lexical Analyzer Syntax Analyzer Semantic Analyzer Intermediate Code Generator tokens AST Front-End Code Optimizer Target Code Generator Back-End IL Object Program Front-End - language dependant part Back-End - machine dependant part 2

3 1. INTRODUCTION (2)  Intermediate language Link front end and back end of the compiler  Advantages Modularity Portability Bridge between semantic gaps Machine-independent code optimization (2014-1) Compiler 3

4 1. INTRODUCTION (3)  Disadvantages Compile time Inefficient code  code optimization (2014-1) Compiler 4

5 1. INTRODUCTION (4)  Types of IL Polish notation – postfix representation, IR 3-address code – Triple, Quadruple, Indirect Triple Tree structure code – AST, TCOL, Diana Virtual machine code – P-code, EM-code, U-code, Bytecode (2014-1) Compiler 5

6 2. POLISH NOTATION (1)  Developed by Lucasiewiez  Usage Intermediate code for arithmetic expression in Fortran compiler Intermediate code for interpreter like BASIC (2014-1) Compiler 6

7 2. POLISH NOTATION (2)  Postfix notation Operand precedes operator No parenthesis Operator stack Easy to change and fast Appropriate for interpreter Not appropriate for optimization (2014-1) Compiler 7

8 3. 3-ADDRESS CODE (1)  Composition 1 operator 2 operands  EX: a = b * (c + d)  Most widely used  Optimized compiler (2014-1) Compiler A := B op C (t1 := c + d) (t2 := b * t1) (a := t2 ) 8

9 3. 3-ADDRESS CODE (2)  Implementation Triple (operator, operand1, operand2) Not appropriate for optimization Indirect triple Table for triple’s execution order Quadruple (operator, operand1, operand2, result) Appropriate for optimization (2014-1) Compiler 9

10 3. 3-ADDRESS CODE (3)  RTL (Register Transfer Language) IL for GNU’s C, C++ compiler All operations use register Based on list concept of LISP EX: (2014-1) Compiler (set (reg:SI 69) (mem:SI (plus:SI (reg:SI 65) (const_int –4)))) (set (reg:SI 70) (mem:SI (plus:SI (reg:SI 65) (const_int –8)))) (set (reg:SI 68) (plus:SI (reg:SI 69) (reg:SI 70))) (set (mem:SF (plus:SI (reg:SI 65) (const_int –12))) (float:SF (reg:SI 68))) 10

11 4. TREE STRUCTURE CODE (1)  Advantages Represent program’s meaning (semantics) Easy to construct Most appropriate for optimized compiler  Parse tree Syntax-directed Many useless information (2014-1) Compiler 11

12 4. TREE STRUCTURE CODE (2)  Abstract syntax tree (AST) Very effective Specify terminal/non-terminal nodes Compile-compiler project (2014-1) Compiler 12

13 5. VIRTUAL MACHINE CODE (1)  Portable compiler Virtual machine connects front- and back-end  instruction set  Abstract machine No general register Stack machine Virtual machine code (2014-1) Compiler 13

14 5. VIRTUAL MACHINE CODE (2)  P-code Intermediate output of Pascal-P compiler P machine Stack machine 4 registers: PC, SP, MP, NP Memory: CODE, STORE (2014-1) Compiler stack heap constant area CODE STORE PC MP SP NP 14

15 5. VIRTUAL MACHINE CODE (3)  U-code Intermediate code for portable Pascal compiler developed by Stanford Based on virtual stack machine All operations are performed on stack (2014-1) Compiler 15

16 5. VIRTUAL MACHINE CODE (4) Types of operations Unary instruction: notop, neg Binary instruction : add, sub, … Stack instruction : lod, str, ldc, ldr Constrol instruction : ujp, tjp, fjp Range check instruction : chkh, chkl Indirect-address instruction : ixa, sta Procedure instruction : cal, ret, … Other instruction: bgn, sym (2014-1) Compiler 16

17 5. VIRTUAL MACHINE CODE (5)  Bytecode Intermediate language for Java Instructions for Java Virtual Machine (JVM) Portability Interpreter, JIT (Just-In-Time) compiler (2014-1) Compiler 17

18 5. VIRTUAL MACHINE CODE (6) Features Small, simple: transferred on the network Instructions for array, class, exception, thread, … Instructions for data types (iadd, fadd, …) Instructions with composite function (pop2) (2014-1) Compiler 18

19 6. SELECTION OF IL (1)  Recent approach: several ILs IL S : Automatically acquired from source Source language dependent and high level (2014-1) Compiler Source Front-End IL S IL S -IL T IL T Back-End Target 19

20 6. SELECTION OF IL (2) IL T : Easy to translate into target machine Target machine dependent and low level IL S to IL T : Translate from IL S into IL T (2014-1) Compiler 20

Download ppt "INTERMEDIATE LANGUAGES SUNG-DONG KIM DEPT. OF COMPUTER ENGINEERING, HANSUNG UNIVERSITY."

Similar presentations

1 Lecture 10 Intermediate Representations. 2 front end »produces an intermediate representation (IR) for the program. optimizer »transforms the code in.

1 Lecture 10 Intermediate Representations. 2 front end »produces an intermediate representation (IR) for the program. optimizer »transforms the code in.
Chapter 8 ICS 412. Code Generation Final phase of a compiler construction. It generates executable code for a target machine. A compiler may instead generate.

Chapter 8 ICS 412. Code Generation Final phase of a compiler construction. It generates executable code for a target machine. A compiler may instead generate.
Intermediate Representation I High-Level to Low-Level IR Translation EECS 483 – Lecture 17 University of Michigan Monday, November 6, 2006.

Intermediate Representation I High-Level to Low-Level IR Translation EECS 483 – Lecture 17 University of Michigan Monday, November 6, 2006.
Lecture 01 - Introduction Eran Yahav 1. 2 Who? Eran Yahav Taub 734 Tel: 8294318 Monday 13:30-14:30

Lecture 01 - Introduction Eran Yahav 1. 2 Who? Eran Yahav Taub 734 Tel: Monday 13:30-14:30
Intermediate code generation. Code Generation Create linear representation of program Result can be machine code, assembly code, code for an abstract.

Intermediate code generation. Code Generation Create linear representation of program Result can be machine code, assembly code, code for an abstract.
1 Intermediate representation Goals: –encode knowledge about the program –facilitate analysis –facilitate retargeting –facilitate optimization scanning.

1 Intermediate representation Goals: –encode knowledge about the program –facilitate analysis –facilitate retargeting –facilitate optimization scanning.
The Analytical Engine Module 6 Program Translation.

The Analytical Engine Module 6 Program Translation.
1 COMP 144 Programming Language Concepts Felix Hernandez-Campos Lecture 31: Building a Runnable Program COMP 144 Programming Language Concepts Spring 2002.

1 COMP 144 Programming Language Concepts Felix Hernandez-Campos Lecture 31: Building a Runnable Program COMP 144 Programming Language Concepts Spring 2002.
Intermediate Code CS 471 October 29, 2007. CS 471 – Fall 2007 1 Intermediate Code Generation Source code Lexical Analysis Syntactic Analysis Semantic.

Intermediate Code CS 471 October 29, CS 471 – Fall Intermediate Code Generation Source code Lexical Analysis Syntactic Analysis Semantic.
Reference Book: Modern Compiler Design by Grune, Bal, Jacobs and Langendoen Wiley 2000.

Reference Book: Modern Compiler Design by Grune, Bal, Jacobs and Langendoen Wiley 2000.
Topic 6 -Code Generation Dr. William A. Maniatty Assistant Prof. Dept. of Computer Science University At Albany CSI 511 Programming Languages and Systems.

Topic 6 -Code Generation Dr. William A. Maniatty Assistant Prof. Dept. of Computer Science University At Albany CSI 511 Programming Languages and Systems.
Compiler Construction1 A Compulsory Module for Students in Computer Science Department Faculty of IT / Al – Al Bayt University First Semester 2009/2010.

Compiler Construction1 A Compulsory Module for Students in Computer Science Department Faculty of IT / Al – Al Bayt University First Semester 2009/2010.
7/15/2015\course\cpeg621-10F\Topic-1a.ppt1 Intermediate Code Generation Reading List: Aho-Sethi-Ullman: Chapter 2.3 Chapter 6.1 ~ 6.2 Chapter 6.3 ~ 6.10.

7/15/2015\course\cpeg621-10F\Topic-1a.ppt1 Intermediate Code Generation Reading List: Aho-Sethi-Ullman: Chapter 2.3 Chapter 6.1 ~ 6.2 Chapter 6.3 ~ 6.10.
CS412/413 Introduction to Compilers Radu Rugina Lecture 15: Translating High IR to Low IR 22 Feb 02.

CS412/413 Introduction to Compilers Radu Rugina Lecture 15: Translating High IR to Low IR 22 Feb 02.
COP4020 Programming Languages

COP4020 Programming Languages
Chapter 1. Introduction.

Chapter 1. Introduction.
1 October 1, 2015 1 October 1, 2015October 1, 2015October 1, 2015 Azusa, CA Sheldon X. Liang Ph. D. Computer Science at Azusa Pacific University Azusa.

1 October 1, October 1, 2015October 1, 2015October 1, 2015 Azusa, CA Sheldon X. Liang Ph. D. Computer Science at Azusa Pacific University Azusa.
PL&C Lab, DongGuk University Compiler Lecture Note, Intermediate LanguagePage 1 제 9 장 중 간 언어 컴파일러 입문.

PL&C Lab, DongGuk University Compiler Lecture Note, Intermediate LanguagePage 1 제 9 장 중 간 언어 컴파일러 입문.
1 Introduction to JVM Based on material produced by Bill Venners.

1 Introduction to JVM Based on material produced by Bill Venners.
CS412/413 Introduction to Compilers and Translators May 3, 1999 Lecture 34: Compiler-like Systems JIT bytecode interpreter src-to-src translator bytecode.

CS412/413 Introduction to Compilers and Translators May 3, 1999 Lecture 34: Compiler-like Systems JIT bytecode interpreter src-to-src translator bytecode.

Similar presentations

Ads by Google