Scribd Logo
Upload

Welcome to Scribd!

  • 18 views

    Btech Cse 7 8 Sem Compiler Design 71905 Nov 2019

    Uploaded by

    Divya Noor
    The document provides information about a compiler design exam including sections on parsing, code generation, optimization and storage allocation strategies. It contains 18 questions across three sections on topics such as grammars, parsing techniques, syntax analysis, intermediate code representations, symbol tables and compiler implementation.

    Copyright:

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

    Btech Cse 7 8 Sem Compiler Design 71905 Nov 2019

    Uploaded by

    Divya Noor
    18 views2 pages
    The document provides information about a compiler design exam including sections on parsing, code generation, optimization and storage allocation strategies. It contains 18 questions across three sections on topics such as grammars, parsing techniques, syntax analysis, intermediate code representations, symbol tables and compiler implementation.

    Original Title

    btech-cse-7-8-sem-compiler-design-71905-nov-2019 (1)

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document provides information about a compiler design exam including sections on parsing, code generation, optimization and storage allocation strategies. It contains 18 questions across three sections on topics such as grammars, parsing techniques, syntax analysis, intermediate code representations, symbol tables and compiler implementation.

    Copyright:

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

    Btech Cse 7 8 Sem Compiler Design 71905 Nov 2019

    Uploaded by

    Divya Noor
    The document provides information about a compiler design exam including sections on parsing, code generation, optimization and storage allocation strategies. It contains 18 questions across three sections on topics such as grammars, parsing techniques, syntax analysis, intermediate code representations, symbol tables and compiler implementation.

    Copyright:

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

    Roll No. Total No.

    of Pages : 02
    Total No. of Questions : 18
    B.Tech.(CSE) (2012 to 2017 E-III) (Sem.–7,8)
    B.Tech. (IT)
    COMPILER DESIGN
    Subject Code : BTCS-913
    M.Code : 71905
    Time : 3 Hrs. Max. Marks : 60

    INSTRUCTION TO CANDIDATES :
    1. SECTION-A is COMPULSORY consisting of TEN questions carrying T WO marks
    each.
    2. SECTION-B contains FIVE questions carrying FIVE marks each and students
    have to attempt any FOUR questions.
    3. SECTION-C contains T HREE questions carrying T EN marks each and students
    have to attempt any T WO questions.

    SECTION-A

    Answer briefly :

    1. Differentiate between stack allocation and static allocation.

    2. Name two compiler construction tools.

    3. Define ‘Code Motion’ and ‘Constant Folding’ with examples.

    4. Define ‘Basic Block’ and write about its significance.

    5. Write at least two differences between LR (0) parsers, SLR (1) parsers, CLR (1) and
    LALR Parsers.

    6. Show that the grammar is ambiguous: S  Sa S  bS S  c

    7. List the functions of a pre-processor.

    8. How do Self Hosting Compilers work?

    9. Name 3 forms of output of code generator.

    10. Write the triple representation of x := y[i].

    1|M - 7 1 9 0 5 (S2)-917

    http://www.ptustudy.com
    SECTION-B
    11. Differentiate between top down and bottom up parsing. Show the steps of a shift reduce
    parser on input (a,(a,a)) using the following grammar :
    S  (L) | a

    L  L, S | S

    12. Translate the arithmetic expression a * – (b + c ) into


    a) Postfix notation
    b) Three-address code
    13. What is the role of the lexical analyzer? Explain the issues in lexical analysis.
    14. What is Code Optimization? Describe the principle sources of optimization.
    15. Explain the various storage allocation strategies applied to activation records.

    SECTION-C
    16. Explain in detail the process of compilation. Illustrate the output of each phase of
    compilation for the input “a = (b+c) * (b+c) * 2”.
    17. What is the need of symbol table. Explain various data structures used for its storage.

    18. Given the CFG G = {S, {S, U, V, W}, {a, b, c, d}, P} with P given as shown below :
    S  UVW

    U  (S) | aSb| d

    V  aV | 

    V  cW | 

    a) Construct a table-based LL(1) predictive parser for G;

    b) Give the parsing actions for the input string “(dc)ac”.

    NOTE : Disclosure of Identity by writing Mobile No. or Making of passing request on any
    page of Answer Sheet will lead to UMC against the Student.

    2|M - 7 1 9 0 5 (S2)-917

    http://www.ptustudy.com

    You might also like