Multiple choice

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?

  1. Finite state automata

  2. Deterministic pushdown automata

  3. Non-Deterministic pushdown automata

  4. Turing machine

Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

Lexical Analysis is implemented by finite automata.