以下哪些陈述是正确的?
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. (A) I 和 II
(B) I 和 IV
(C) III 和 IV
(D) I、III 和 IV答案：(乙)
说明： II 为假，在递归中，编译器无法确定递归调用所需的空间。
Ⅲ是假的。见 http://www.cs.sunysb.edu/~cse304/Fall09/Lectures/attributes-handout.pdf
这个问题的测验