GATE 2009 CS – Question 42
Which statements are TRUE?
I. Some programming languages have parsing algorithms of complexity less than Θ(n³).
II. A language allowing recursion can be implemented with static storage allocation.
III. No L-attributed definition can be evaluated within bottom-up parsing.
IV. Code-improving transformations can be done at both source and intermediate-code levels.
Practise this question in The GATE Grind →
Show answer and explanation
Correct answer: (B) I and IV
Explanation
We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort