Skip to content
Related Articles

Related Articles

GATE | GATE-CS-2009 | Question 42
  • Last Updated : 24 Jan, 2014

Which of the following statements are TRUE?

I.  There exist parsing algorithms for some programming languages 
     whose complexities are less than O(n3).
II.  A programming language which allows recursion can be implemented 
    with static storage allocation.
III. No L-attributed definition can be evaluated in The framework 
     of bottom-up parsing.
IV. Code improving transformations can be performed at both source 
    language and intermediate code level.

(A) I and II
(B) I and IV
(C) III and IV
(D) I, III and IV

Answer: (B)

Explanation: II is false, in recursion, compiler cannot determine the space needed for recursive calls.

III is false.  See

Quiz of this Question


My Personal Notes arrow_drop_up
Recommended Articles
Page :