Which of the following statements are TRUE? I. There exist parsing algorithms for some programming languages whose complexities are less than O(n3).

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
 

1Comment
Satya Prakash @sprp 21 Jan 2016 08:02 pm

1 and 4 are true

2: compiler cannot determine the space needed for recursive calls.

3: L-attributed definition can be evaluated using bottom up parsing ,so it is false 

Pages