in Unknown Category edited by
357 views
1 vote
1 vote

Which of the following machine model can be used in a necessary and sufficient sense for lexical analysis in modern computer language?

  1. Deterministic Push down Automata
  2. Finite Automata
  3. Non-Deterministic Finite Automata
  4. Turing Machine
in Unknown Category edited by
by
357 views

1 Answer

0 votes
0 votes
  1. Finite automata

Same as https://gateoverflow.in/2121/gate2011-19 

Answer:

Related questions