...
February 26, 2025

GATE 2010

Question 38 The grammar S → aSa|bS|c is A LL(1) but not LR(1) B LR(1) but not LR(1) C Both LL(1) and LR(1) D Neither LL(1) […]
March 12, 2025

GATE 2005

Question 86 Consider the following expression grammar. The seman­tic rules for expression calculation are stated next to each grammar production. E → number E.val = number. […]
March 14, 2025

GATE 2009

Question 42 Which of the following statements are TRUE? I.There exist parsing algorithms for some programming languages whose complexities are less than θ(n3). II.A programming language […]
March 14, 2025

GATE 2008

Question 11 Which of the following describes a handle (as applicable to LR-parsing) appropriately? A It is the position in a sentential form where the next […]