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