CD gate 2020

Set-15 GATE-2006 CD

CD |Gate-2007| Previous Year Questions| Set-14

CD |Gate-2007| Compiler Design 1. Which one of the following is a top-down parser? [GATE – 2007] a. Recursive descent parser.b. Operator precedence parser.c. An LR(k) parser.d. An LALR(k) parser. Answer  : a) 2. Consider the grammar with non-terminals N = {S,C,S1 },terminals T={a,b,i,t,e}, with S as the start symbol, and the following set of …

CD |Gate-2007| Previous Year Questions| Set-14 Read More »

Set-15 GATE-2006 CD

CD |Gate-2009| Previous Year Questions| Set-12

CD |Gate-2009| Compiler Design Match all items in Group 1 with correct options from those given in Group : [GATE – 2009]           Group 1           Group 2 P. Regular Expression 1. Syntax Analysis Q. Pushdown Automata 2. Code generation R. Dataflow analysis 3. Lexical analysis S. Register allocation 4. Code optimization a. P-4, …

CD |Gate-2009| Previous Year Questions| Set-12 Read More »

Set-15 GATE-2006 CD

CD |Gate-2010| Previous Year Questions| Set-11

CD |Gate-2010| Compiler Design 1. Which data structure in a compiler is used for managing information about variables and their attributes? [GATE – 2010] a. Abstract syntax treeb. Symbol Tablec. Semantic Stackd. Parse Table Answer : b) 2. Which languages necessarily need heap allocation in the runtime environment? [GATE – 2010] a. Those that support …

CD |Gate-2010| Previous Year Questions| Set-11 Read More »

Set-15 GATE-2006 CD

CD |Gate-2011| Previous Year Questions| Set-10

CD |Gate-2011| Compiler Design The lexical analysis for a modern computer language such as Java needs the power of which one of the following machine models in a necessary and sufficient sense? [GATE – 2011] a. Finite state automatab. Deterministic pushdown automatac. Non-Deterministic pushdown automatad. Turing machine Answer : a) In a compiler, keywords of …

CD |Gate-2011| Previous Year Questions| Set-10 Read More »

Set-15 GATE-2006 CD

CD |Gate-2012| Previous Year Questions| Set-9

CD |Gate-2012| Compiler Design 1. Consider the program given below, in a block-structured pseudo-language with lexical scoping and nesting of procedures permitted. Program main;  Var …    Procedure A1;     Var …     Call A2;    End A1    Procedure A2;      Var …      Procedure A21;        Var …        Call A1;        End A21    Call A21;  End A21    Call A1;  End main. Consider the calling chain : Main->A1->A2->A21->A1 …

CD |Gate-2012| Previous Year Questions| Set-9 Read More »