GATE | GATE CS 2011 | Question 19

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?

(A)

Finite state automata

(B)

Deterministic pushdown automata

(C)

Non-Deterministic pushdown automata

(D)

Turing Machine

Answer: (A)

Explanation:

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 https://www.geeksforgeeks.org/automata-theory-set-3/

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

My Personal Notes arrow_drop_up

Save