The lexical analysis for a modern 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
Click for Solution
  Asked in CIL