April 3, 2025

GATE 2014 [Set-1]

Question 45 Let L be a language and L’ be its complement. Which one of the following is NOT a viable possibility? A Neither L nor […]
April 4, 2025

GATE 2015 [Set-2]

Question 20 In the context of abstract-syntax-tree (AST) and control-flow-graph (CFG), which one of the following is TRUE? A In both AST and CFG, let node, […]
April 4, 2025

GATE 2014 [Set-3]

Question 28 Which of the following statements are CORRECT? 1) Static allocation of all data areas by a compiler makes it impossible to implement recursion. 2) […]
April 5, 2025

GATE 2013

Question 9 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 […]