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

Question

Quizplus · Accepted Answer

I. True, there are efficient parsing algorithms for certain programming languages that operate in linear time, O(n), which is less than O(n^3).IV. True, code improving transformations can indeed be performed at both the source language level and the intermediate code level to optimize the program.

Which of the Following Statements Are TRUE