Q. 19 The lexical analysis for a modern computer language such as Java needs the
power of which one of the following machine models in a necessary and sufficient
sense?
(A) Finite state automata
(B) deterministic pushdown automata
(C) Non-deterministic pushdown automata
(D) Turing machine
Answer: (A)
Explanation:
