Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 262 views

    UCS802

    Uploaded by

    yadwinder
    This document appears to be the first page of an exam for a compiler construction course. It contains 10 questions related to compiler design topics like LR parsing, attribute grammars, code generation using three-address code, and symbol tables. The exam covers grammar analysis techniques, parsing methods, semantic analysis, code generation and the phases of a compiler.

    Copyright:

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

    UCS802

    Uploaded by

    yadwinder
    262 views2 pages
    This document appears to be the first page of an exam for a compiler construction course. It contains 10 questions related to compiler design topics like LR parsing, attribute grammars, code generation using three-address code, and symbol tables. The exam covers grammar analysis techniques, parsing methods, semantic analysis, code generation and the phases of a compiler.

    Original Description:

    compiler constuction practice paper

    Original Title

    UCS802 (3)

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document appears to be the first page of an exam for a compiler construction course. It contains 10 questions related to compiler design topics like LR parsing, attribute grammars, code generation using three-address code, and symbol tables. The exam covers grammar analysis techniques, parsing methods, semantic analysis, code generation and the phases of a compiler.

    Copyright:

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

    UCS802

    Uploaded by

    yadwinder
    This document appears to be the first page of an exam for a compiler construction course. It contains 10 questions related to compiler design topics like LR parsing, attribute grammars, code generation using three-address code, and symbol tables. The exam covers grammar analysis techniques, parsing methods, semantic analysis, code generation and the phases of a compiler.

    Copyright:

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

    Page 1 of 2

    Roll Number:
    Thapar University, Patiala
    Department of Computer Science and Engineering

    B. E. (Final Year) Auxiliary Examination Course code: UCS 802


    Course Narrie:Qompiler Construction
    Time: 3 Hours, M. Marks: 100 Name Of Faculty: Sunita Garhwal
    DATED: 27/07/2017

    Note: Attempt all questions. Assume missing data, if any, suitably


    01. Consider the following grammar G I : (10)
    goal expr
    expr --> term + expr
    expr —> term
    term —> factor * term
    term -factor
    factor —4 id
    a) Construct the DFA of LR(1) items for grammar Gi
    b) Construct LR(1) parsing table.
    c) Show the parsing stack and the actions for the input string : w= id+id*id.

    Q2. Consider the following grammar G2 and perform the following(s) : (10)
    S —› V = E
    E-->FIE+F
    F --> V I integer I (E)
    V id
    a) Construct the DFA of LALR(1) items.
    b) Construct LALR(1) parsing table.
    c) Show the processing of input string : w=id=integer+id.

    Q3. Execute the following program and explain its output in terms of the runtime environment : (15)
    program chaining;
    procedure p;
    var x: integer;
    procedure q;
    procedure r
    begin
    x := 2;

    If then p;
    end{ of r}
    begin
    r;
    end{ of q}
    begin
    q;
    end { of p}
    begin {of main }
    p;
    end.

    Page 1 of 2
    (10)
    p4. Consider the following grammar for simple integer arithmetic expressions :
    E-*E+TIE-TIT
    • T-*T*FIF
    F ->(E) I num

    a) Write the attribute equations for the val attribute.


    b) Draw the parse tree for ( 42-5) / 3, together with attribute values.

    Q5. Explain the five phases of compiler. Illustrate with help of some example. (10)

    Q6. Consider the following expression:


    (a /b + c) * ( b + c) -( a +b + c) (10)

    a) Write sequence of three-address instructions that would be generated by above expression.


    b) Represent the Quadruples, Triples and Indirect-Triple implementation for the above three-address
    code.

    Q7. Consider the following grammar: (10)


    S -4 Aa
    A- Sb I c
    a) Remove the left recursion.
    • b) Construct First and Follow sets for the non-terminals of the resulting grammar.

    (10)
    Q8. Explain the term Left factoring. Illustrate with help of some example

    Q9. Given the regular expression r = (b I a )*baa . Convert it into NFA using Thompson's Construction.
    Convert the obtained NFA into DFA and minimize it. (10)

    Q10. Discuss in brief the importance of symbol table in compiler design. (5)

    You might also like