Which of the following statements are TRUE? I There exist parsing algorithms for some programming languages hose complex are less than θ(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
Which of the following statements are TRUE? I There exist parsing algorithms for some programming languages hose complex are less than θ(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 Correct Answer I and IV
I. Statement is true since there are some parsers which take 0 (n log2n) times for parsing. II. Completely false, since there is no use of stack which is required for recursion. III. False IV. True since both types of optimizations are applied.
মোঃ আরিফুল ইসলাম
Feb 20, 2025