GATE Exam | Aptitude Questions | GATE Syllabus | GATE Result | Mock Test | GATE Preparation
0 votes

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?


Finite state automata


Deterministic pushdown automata


Non-Deterministic pushdown automata


Turing Machine

asked in Lexical analysis, parsing by gate

1 Answer

0 votes
Finite state automata
answered by gate

Related questions

The best answer to any question