GATE | GATE CS Mock 2018 | Set 2 | Question 12

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

Answer: (D)
Explanation: (I) The output of a lexical analyzer is tokens.
(II) Total number of tokens in printf("i=%d, &i=%x", i, &i); are 10.
(III) Symbol table can be implementation by using array, hash table, tree and linked lists.

So, option (D) is correct.
Quiz of this Question