Scribd Logo
Upload

Welcome to Scribd!

  • 53 views

    PCC CS501

    Uploaded by

    Sagar Chakraborty
    The document discusses compiler design and related topics. It contains a paper with multiple choice and short answer questions covering topics like lexical analysis, parsing, code optimization, and regular expressions. It also includes longer answer questions about compiler phases, ambiguity in grammars, implementation of three address code, construction of DFA from regular expressions, and designing a lexical analyzer.

    Copyright:

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

    PCC CS501

    Uploaded by

    Sagar Chakraborty
    53 views2 pages
    The document discusses compiler design and related topics. It contains a paper with multiple choice and short answer questions covering topics like lexical analysis, parsing, code optimization, and regular expressions. It also includes longer answer questions about compiler phases, ambiguity in grammars, implementation of three address code, construction of DFA from regular expressions, and designing a lexical analyzer.

    Original Description:

    University Question Paper

    Original Title

    PCC‐CS501

    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 discusses compiler design and related topics. It contains a paper with multiple choice and short answer questions covering topics like lexical analysis, parsing, code optimization, and regular expressions. It also includes longer answer questions about compiler phases, ambiguity in grammars, implementation of three address code, construction of DFA from regular expressions, and designing a lexical analyzer.

    Copyright:

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

    PCC CS501

    Uploaded by

    Sagar Chakraborty
    The document discusses compiler design and related topics. It contains a paper with multiple choice and short answer questions covering topics like lexical analysis, parsing, code optimization, and regular expressions. It also includes longer answer questions about compiler phases, ambiguity in grammars, implementation of three address code, construction of DFA from regular expressions, and designing a lexical analyzer.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 2

    CS/B.

    TECH(N)/ODD/SEM-5/5506/2022-2023/I139

    MAULANA ABUL KALAM AZAD UNIVERSITY OF TECHNOLOGY, WEST BENGAL


    Paper Code : PCC-CS501 Compiler Design

    Time Allotted : 3 Hours Full Marks :70


    The Figures in the margin indicate full marks.
    Candidate are required to give their answers in their own words as far as practicable

    Group-A (Very Short Answer Type Question)

    1. Answer any ten of the following : [ 1 x 10 = 10 ]


    (I) If all the operators are binary, then a string of operands and operators is a postfix expression if and only if ________
    (II) Given a grammar G=(V, T, P, S) and every production in P is of the form A->α where A is in V and α is in (V U T)*, then G
    is _________
    (III) A compiler running on computes with a small memory would normally be
    (IV) Input to LEX is
    (V) A basic block is ______
    (VI) Given a finite automaton M=(Q,∑, δ , q0, F). If δ maps Q × ∑ to 2 Q, then _____
    (VII) Given a string abc , the string acc is a _____________
    (VIII) A garbage is __________
    (IX) How many descriptors are used for track both the registers (for availability) and addresses (location of values) while
    generating the code?
    (X) A synthesized attribute is an attribute whose value at a parse tree node is defined in terms of _________
    (XI) Elimination of loop invariant computation is a peephole optimization. True/False?
    (XII) ____________ is a loop optimization

    Group-B (Short Answer Type Question)


    Answer any three of the following [ 5 x 3 = 15 ]

    2. Describe input buffering in lexical analyser. [5]


    3. Explain the model of a non recursive predictive parser with a diagram. [5]
    4. Find the output, given grammar G1 and associated semantic rules and input: aadbd [5]
    • S->AS {print(1)}
    • S->AB {print(2)}
    • A->a {print(3)}
    • B->b C {print(4)}
    • B->d B {print(5)}
    • C->c {print(6)}
    5. What is ambiguity? Show that G2:{S->aS|Sa|a} is ambiguous [5]
    6. What is code optimization? Optimize the following C-code: [5]
    count=0;
    result= 0;
    while(count++ < 20)
    {
    increment= 2*count;
    result +=increment;
    }

    Group-C (Long Answer Type Question)


    Answer any three of the following [ 15 x 3 = 45 ]

    1/2
    7. For the following grammar [ 3+5+5+2 ]
    E-> E or T|T
    T->T and F|F
    F-> not F|(E)| 0|1
    a) Eliminate left recursion from the above grammar
    b) Find FIRST(X),Follow(X) for each variable in the grammar
    c) Construct a predictive parser table for the grammar
    d) Is the above grammar LL(1). Justify your answer
    8. a) What is a compiler? [ 2+10+3 ]
    b) Explain the different phases of compiler with an example
    c) Compare and contrast between a compiler and an interpreter
    9. i) Express the expression y=(a+b)*c in [ 9+6 ]
    a.)postfix notation
    b.) Abstract syntax tree
    c). Three address code
    ii) Implement the TAC using
    a. quadruples
    b. triples
    c. indirect triples
    10. Consider the regular expression (a+b)*a(a+b)(a+b) [ 3+6+3+3 ]
    I. Augment the expression and construct the syntax tree for the above regular expression
    II. Find Firstpos() and Lastpos() for every internal node in the syntax tree
    III. Find Followpos() for every position in the syntax tree
    IV. Construct the corresponding DFA for the given RE using Followpos()
    11. a) What is LEX? [ 1+5+9 ]
    b) Explain the working of LEX
    c) Show the step by step construction of a lexical analyzer with the following three tokens
    •a
    • abb
    • a*b+

    *** END OF PAPER ***

    2/2

    You might also like