Multiple Choice
Consider the following statements:
(I) The output of a lexical analyzer is groups of characters.
(II) Total number of tokens in printf("i=%d, &i=%x", i, &i) ; are 11.
(III) Symbol table can be implementation by using array and hash table but not tree.
Which of the following statement(s) is/are correct?
A) Only (I)
B) Only (II) and (III)
C) All (I) , (II) , and (III)
D) None of these
Correct Answer:

Verified
Correct Answer:
Verified
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
Q12: Consider the following translation scheme. S ?
Q13: Consider the following grammar. S -> S
Q14: Consider the grammar S ? (S) |
Q15: In compiler optimization, operator strength reduction uses
Q16: The grammar A ? AA | (A)