The lexical analysis for a modern language such as Java needs the power of which one of the following machine models in a necessary and sufficient sense?

Question

TuteeHUB · Accepted Answer

Deterministic pushdown automata

TuteeHUB · Answer

Finite state automata

TuteeHUB · Answer

Non-deterministic pushdown automata

TuteeHUB · Answer

Turing machine

1.	The lexical analysis for a modern 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» B. Deterministic pushdown automata

The lexical analysis for a modern language such as Java needs the power of which one of the following machine models in a necessary and sufficient sense?

Discussion

No Comment Found

Related MCQs

Reply to Comment