CD |Gate-2006| Compiler Design 1. Consider the following grammar. Consider the following LR(0) items corresponding to the grammar above. Given the items above, which two of them will appear in the same set in the canonical sets-of-items for the grammar? [GATE – 2006] a. (i) and (ii)b. (ii) and (iii)c. (i) and (iii)d. None …
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-2008| Compiler Design Which of the following describes a handle (as applicable to LR-parsing) appropriately? [GATE – 2008] a. It is the position in a sentential form where the next shift or reduce operation will occur.b. It is non-terminal whose production will be used for reduction in the next step.c. It is a production …
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-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-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-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-2013| Compiler Design 1. 12. What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon- and unit-production (i.e., of type A → є and A → a) to parse a string with n tokens? [GATE – 2013] a. n/2b. n-1c. 2n-1d. 2n …
CD |Gate-2014| Compiler Design 1. Which one of the following is FALSE? [GATE – 2014] a. A basic block is a sequence of instructions where control enters the sequence at the beginning and exits at the end.b. Available expression analysis can be used for common subexpression elimination.c. Live variable analysis can be used for dead …
CD |Gate-2015| Compiler Design 1. Which one of the following is True at any valid state in shift-reduce parsing? [GATE – 2015] a. Viable prefixes appear only at the bottom of the stack and not insideb. Viable prefixes appear only at the top of the stack and not insidec. The stack contains only a set …