Q. 10 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:
