Open In App

GATE | GATE-CS-2009 | Question 42

Like Article
Like
Save
Share
Report

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 http://www.cs.sunysb.edu/~cse304/Fall09/Lectures/attributes-handout.pdf

Quiz of this Question


Last Updated : 28 Jun, 2021
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads