Scribd Logo
Upload

Welcome to Scribd!

  • 46 views

    Pdfs

    Uploaded by

    ßrijesh Patel
    This document is an exam for a Compiler Design course. It contains 5 questions assessing student knowledge of compiler design topics. Question 1 asks about compiler components, input buffering techniques, and compiler phases. Question 2 covers handle pruning, ambiguous grammars, and error recovery strategies. Question 3 addresses lexical analysis tasks, removing left recursion, and determining if a grammar is LR(1) or LALR(1). Question 4 defines attribute types, constructs syntax trees, and asks about symbol table management and code generation. Question 5 compares static and dynamic memory allocation, describes activation records, and asks about code optimization techniques and code generator design issues.

    Copyright:

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

    Pdfs

    Uploaded by

    ßrijesh Patel
    46 views2 pages
    This document is an exam for a Compiler Design course. It contains 5 questions assessing student knowledge of compiler design topics. Question 1 asks about compiler components, input buffering techniques, and compiler phases. Question 2 covers handle pruning, ambiguous grammars, and error recovery strategies. Question 3 addresses lexical analysis tasks, removing left recursion, and determining if a grammar is LR(1) or LALR(1). Question 4 defines attribute types, constructs syntax trees, and asks about symbol table management and code generation. Question 5 compares static and dynamic memory allocation, describes activation records, and asks about code optimization techniques and code generator design issues.

    Original Title

    pdfs

    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 is an exam for a Compiler Design course. It contains 5 questions assessing student knowledge of compiler design topics. Question 1 asks about compiler components, input buffering techniques, and compiler phases. Question 2 covers handle pruning, ambiguous grammars, and error recovery strategies. Question 3 addresses lexical analysis tasks, removing left recursion, and determining if a grammar is LR(1) or LALR(1). Question 4 defines attribute types, constructs syntax trees, and asks about symbol table management and code generation. Question 5 compares static and dynamic memory allocation, describes activation records, and asks about code optimization techniques and code generator design issues.

    Copyright:

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

    Pdfs

    Uploaded by

    ßrijesh Patel
    This document is an exam for a Compiler Design course. It contains 5 questions assessing student knowledge of compiler design topics. Question 1 asks about compiler components, input buffering techniques, and compiler phases. Question 2 covers handle pruning, ambiguous grammars, and error recovery strategies. Question 3 addresses lexical analysis tasks, removing left recursion, and determining if a grammar is LR(1) or LALR(1). Question 4 defines attribute types, constructs syntax trees, and asks about symbol table management and code generation. Question 5 compares static and dynamic memory allocation, describes activation records, and asks about code optimization techniques and code generator design issues.

    Copyright:

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

    Seat No.: ________ Enrolment No.

    ___________

    GUJARAT TECHNOLOGICAL UNIVERSITY


    BE - SEMESTER–VII (NEW) EXAMINATION – WINTER 2022
    Subject Code:3170701 Date:18-01-2023
    Subject Name:Complier Design
    Time:10:30 AM TO 01:00 PM Total Marks:70
    Instructions:
    1. Attempt all questions.
    2. Make suitable assumptions wherever necessary.
    3. Figures to the right indicate full marks.
    4. Simple and non-programmable scientific calculators are allowed.

    MARKS

    Q.1 (a) What is compiler? What is front-end and back-end of compiler? 03


    (b) Write a brief note on input buffering techniques. 04
    (c) Explain input, output and action performed by each phases of compiler 07
    with example.

    Q.2 (a) Define Handle, Handle pruning, Ambiguous grammar. 03


    (b) Explain error recovery strategies. 04
    (c) Define token, lexeme and pattern. Identify the lexemes that makes up the 07
    tokens for the following code
    const p = 10;
    if( a < p)
    { a++ ;
    If(a== 5)
    continue ;
    }
    OR
    (c) Construct deterministic finite automata without constructing NFA for 07
    following regular expression.
    (a/b)*abb*.

    Q.3 (a) What is lexical analysis? Which are the tasks performed by lexical 03
    analyzer.
    (b) Give the rule to remove left recursive grammar. And Eliminate left 04
    recursion from following grammar.
    S → Aa | b
    A → Ac | Sd | f
    (c) Show the following grammar is LR(1) but not LALR(1). 07
    S->Aa │bAc │Bc│bBa
    A->d
    B->d
    OR
    Q.3 (a) Write RE the following language.. 03
    1. All string of 0’s and 1’s that do not contain 11.
    2. All string of 0’s and 1’s that every 1 is followed by 00
    (b) What is left factoring in CFG? Perform the Left factoring of following 04
    Grammar.
    S → iEtS / iEtSaS / a
    E→b

    1
    (c) Construct SLR parsing table for the following grammar : 07
    S → (L) | a
    L→ L,S | S

    Q.4 (a) Define : 1) synthesized attribute 2) inherited attribute 03


    (b) Construct syntax tree and DAG for following expression: 04
    X = a * (b+c)- (b+c)* d
    (c) Give syntax directed definition for simple desk calculator. Also show 07
    annotated parse tree for 6*5+7n,
    OR
    Q.4 (a) Write a short note on Symbol table management. 03
    (b) Explain dynamic memory allocation strategy. 04
    (c) Translate the expression –(a+b)*(c+d)*(a+b*c) into Quadruples, Triples, 07
    and Indirect triples

    Q.5 (a) Compare: Static v/s Dynamic Memory Allocation. 03


    (b) Explain Activation Record. 04
    (c) Explain any three code-optimization technique in detail. 07
    OR
    Q.5 (a) Explain Basic Block and Flow Graph with example. 03
    (b) Explain various parameter passing methods. 04
    (c) Explain various issues in design of code generator. 07

    *************

    You might also like