Multiple Choice
Which of the following statements are TRUE?
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 and II
B) I and IV
C) III and IV
D) I, III and IV
Correct Answer:

Verified
Correct Answer:
Verified
Q2: Consider the following statements related to compiler
Q3: Which one of the following statements is
Q4: From the given data below : a
Q5: In a compiler, keywords of a language
Q6: The lexical analysis for a modern computer
Q7: Which of the following statement(s) regarding a
Q8: The number of tokens in the following
Q9: Consider the grammar defined by the following
Q10: The grammar S ? aSa | bS
Q11: Consider the following statements:<br>(I) The output of