Q1. Define following terms.

This is question 1 (3 marks) from the GTU Compiler Design BE Summer 2022 question paper. Subject code: 2170701.

Q1. Pattern ii) Lexeme iii) Token

This is question 1 (null marks) from the GTU Compiler Design BE Summer 2022 question paper. Subject code: 2170701.

Q2. Construct a DFA for (a|b)*abb using Firstpos, Lastpos and Followpos.

This is question 2 (7 marks) from the GTU Compiler Design BE Summer 2022 question paper. Subject code: 2170701.

Q2. Short note on input buffering techniques.

This is question 2 (7 marks) from the GTU Compiler Design BE Summer 2022 question paper. Subject code: 2170701.

SummerBE2022

Compiler Design — Summer 2022

Q: Q1. List Cousins of Compiler. Explain any one in detail.

This is question 1 (4 marks) from the GTU Compiler Design BE Summer 2022 question paper. Subject code: 2170701.

Q: Q1. Explain phases of compilers with suitable example.

This is question 1 (7 marks) from the GTU Compiler Design BE Summer 2022 question paper. Subject code: 2170701.

Q: Q2. Draw transition diagram of Relational Operators.

This is question 2 (3 marks) from the GTU Compiler Design BE Summer 2022 question paper. Subject code: 2170701.

Q: Q2. Consider the following grammar to construct leftmost and right most derivation for the sentence abab. SaSbS | bSaS | ε

This is question 2 (4 marks) from the GTU Compiler Design BE Summer 2022 question paper. Subject code: 2170701.

Q: Q3. Perform the Left factoring of following Grammar. S  iEtS SiEtSeS Sa E b

This is question 3 (3 marks) from the GTU Compiler Design BE Summer 2022 question paper. Subject code: 2170701.

Q: Q3. Discuss Brut Force Parsing with following grammar. S aAd/aB A  b/c B  ccd/ddc Input : accd

This is question 3 (4 marks) from the GTU Compiler Design BE Summer 2022 question paper. Subject code: 2170701.

Subject Code2170701

ProgramBachelor of Engineering

Total Marks70

Questions16

Exam Date31 May 2022

Exam Time02:30 PM TO 05:00 PM

Questions26

Define following terms.

[3 marks]

Pattern ii) Lexeme iii) Token

[ marks]

List Cousins of Compiler. Explain any one in detail.

[4 marks]

Explain phases of compilers with suitable example.

[7 marks]

Draw transition diagram of Relational Operators.

[3 marks]

Consider the following grammar to construct leftmost and right most derivation for the sentence abab. SaSbS | bSaS | ε

[4 marks]

Download PDF

Perform the Left factoring of following Grammar. S  iEtS SiEtSeS Sa E b

[3 marks]

Discuss Brut Force Parsing with following grammar. S aAd/aB A  b/c B  ccd/ddc Input : accd

[4 marks]

Construct SLR parsing table for E E+T | T T T*F | F F (E) | id

[7 marks]

Remove left recursion from given grammar. A Ax | a, BBy | b, CCz | ɛ

[3 marks]

Find First & Follow for S AaAb | BbBa A ε B ε

[4 marks]

Check weather the grammar is LL(1) or not? Justify S iEtS | iEtSeS |a E b

[7 marks]

List and Explain Parameter Passing Methods.

[3 marks]

Discuss Shift- Reduce and Reduce-Reduce Conflicts for LR Parsers.

[4 marks]

Give SDD for Simple Desk Calculator and Discuss S Attributed Definition.

[7 marks]

Differentiate Static Vs Dynamic Memory Allocation.

[3 marks]

Explain Activation Record in brief.

[4 marks]

Give the SDT that converts infix to postfix expression for the following grammar and generate the annotated parse tree for input string “9-5+2”. E E+T |E-T E T T 0|1|…|9

[7 marks]

Short note on Control Stack.

[3 marks]

List and Explain (any one) Symbol Table Data Structures.

[4 marks]

Short note on Peephole Optimization Techniques.

[7 marks]

Draw DAG for i=i*5

[3 marks]

Explain Three Address Codes with an example.

[4 marks]

Write the generic issues in the design of code generators.

[7 marks]