|Que.||Which of the following statements are TRUE?
I. There exist parsing algorithms for some programming languages
whose complexities are less than O(n^3).
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:I and IV|