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?

🎲 Try a Random Question  |  Total Questions in Quiz: 95  |  🧠 Study this quiz with Flashcards
This question is part of a full practice quiz:
Theory of Computation and Compiler Design Practice Test — practice the complete quiz, review flashcards, or try a random question.

Automata theory (also known as Theory Of Computation) is a theoretical branch of Computer Science and Mathematics, which mainly deals with the logic of computation with respect to simple machines, referred to as automata. Automata* enables scientists to understand how machines compute the functions and solve problems.
Theory of Computation is very important in compiler design as it helps in writing efficient algorithms, which help make efficient compiler construcion.


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.<br>Which of the following statement(s) is/are correct?