☰
GkSeries.com
✕

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 & Explanation
Option: [A]

⭐ Make GKSeries Your Preferred Source on Google

Add GKSeries as Preferred Source
Click Here to Read more questions