📜  门| GATE-CS-2009 |第42章

📅  最后修改于: 2021-07-02 18:11:33             🧑  作者: Mango

下列哪个陈述是正确的?

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)我和四
(C) III和IV
(D)一,三和四答案: (B)
说明: II是错误的,在递归中,编译器无法确定递归调用所需的空间。

III是错误的。参见http://www.cs.sunysb.edu/~cse304/Fall09/Lectures/attributes-handout.pdf
这个问题的测验