Scribd Logo
Upload

Welcome to Scribd!

  • 230 views

    Intermediate Code Generation in Compiler Design: The Benefits of Using Machine Independent Intermediate Code Are

    Uploaded by

    meenasi
    The document discusses intermediate code generation in compiler design. It explains that intermediate code is machine independent and allows for portability, easier retargeting, and optimization of source code. Common intermediate representations include postfix notation, syntax trees, and three-address code. Three-address code uses temporary variables and represents statements as having two operands and one result.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Intermediate Code Generation in Compiler Design: The Benefits of Using Machine Independent Intermediate Code Are

    Uploaded by

    meenasi
    230 views2 pages
    The document discusses intermediate code generation in compiler design. It explains that intermediate code is machine independent and allows for portability, easier retargeting, and optimization of source code. Common intermediate representations include postfix notation, syntax trees, and three-address code. Three-address code uses temporary variables and represents statements as having two operands and one result.

    Original Description:

    Code Generation

    Original Title

    IC_CD

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses intermediate code generation in compiler design. It explains that intermediate code is machine independent and allows for portability, easier retargeting, and optimization of source code. Common intermediate representations include postfix notation, syntax trees, and three-address code. Three-address code uses temporary variables and represents statements as having two operands and one result.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    230 views2 pages

    Intermediate Code Generation in Compiler Design: The Benefits of Using Machine Independent Intermediate Code Are

    Uploaded by

    meenasi
    The document discusses intermediate code generation in compiler design. It explains that intermediate code is machine independent and allows for portability, easier retargeting, and optimization of source code. Common intermediate representations include postfix notation, syntax trees, and three-address code. Three-address code uses temporary variables and represents statements as having two operands and one result.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 2

    Intermediate Code Generation in Compiler Design

    In the analysis-synthesis model of a compiler, the front end of a compiler translates a


    source program into an independent intermediate code, then the back end of the compiler uses
    this intermediate code to generate the target code (which can be understood by the machine).

    The benefits of using machine independent intermediate code are:

     Because of the machine independent intermediate code, portability will be enhanced.For


    ex, suppose, if a compiler translates the source language to its target machine language
    without having the option for generating intermediate code, then for each new machine,
    a full native compiler is required. Because, obviously, there were some modifications in
    the compiler itself according to the machine specifications.
     Retargeting is facilitated
     It is easier to apply source code modification to improve the performance of source code
    by optimising the intermediate code.

    If we generate machine code directly from source code then for n target machine we will
    have n optimisers and n code generators but if we will have a machine independent
    intermediate code, we will have only one optimiser. Intermediate code can be either language
    specific (e.g., Bytecode for Java) or language. independent (three-address code).

    The following are commonly used intermediate code representation :

     Postfix notation
     Syntax tree
     Three-address code

    Postfix Notation
    The ordinary (infix) way of writing the sum of a and b is with operator in the middle : a +
    b . The postfix notation for the same expression places the operator at the right end as ab +. In
    general, if e1 and e2 are any postfix expressions, and + is any binary operator, the result of
    applying + to the values denoted by e1 and e2 is postfix notation by e1e2 +. No parentheses are
    needed in postfix notation because the position and arity (number of arguments) of the
    operators permit only one way to decode a postfix expression. In postfix notation the operator
    follows the operand.

    Eg : the postfix representation of the expression (a – b) * (c + d) + (a – b) is : ab – cd + ab -+*.

    Three-Address Code:
    A statement involving no more than three references(two for operands and one for
    result) is known as three address statement. A sequence of three address statements is known
    as three address code. Three address statement is of the form x = y op z , here x, y, z will have
    address (memory location). Sometimes a statement might contain less than three references
    but it is still called three address statements.

    Eg: the three address code for the expression a + b * c + d :

    T1=b*c
    T2=a+T1
    T3=T2+d

    T 1 , T 2 , T 3 are temporary variables.

    Syntax Tree
    Syntax tree is nothing more than condensed form of a parse tree. The operator and
    keyword nodes of the parse tree are moved to their parents and a chain of single productions is
    replaced by single link in syntax tree the internal nodes are operators and child nodes are
    operands. To form syntax tree put parentheses in the expression, this way it's easy to recognize
    which operand should come first.

    Example :
    x = (a + b * c) / (a – b * c)

    You might also like