Home / Engineering / Theory of Computation and Compiler Design / Question

M

Mr. Dubey • 51.43K Points
Coach

Q.) 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
Correct answer : Option (A) - Finite state automata

Share

Discusssion

Login to discuss.