Skip to content
Related Articles
Get the best out of our app
GeeksforGeeks App
Open App

Related Articles

GATE | GATE CS 2011 | Question 19

Improve Article
Save Article
Like Article
Improve Article
Save Article
Like Article

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

Answer: (A)


In lexical analysis finite automata is used to produce tokens in the form of identifiers, keywords and constants from the input program. In the process of pattern recognition, it used to search keywords by using string-matching algorithms. See

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up
Last Updated : 06 Jan, 2020
Like Article
Save Article
Similar Reads