

MCQOPTIONS
Saved Bookmarks
1. |
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 automataDeterministic pushdown automataDeterministic pushdown automataDeterministic pushdown automataDeterministic pushdown automataDeterministic pushdown automataDeterministic pushdown automataDeterministic pushdown automata |
C. | Non-Deterministic pushdown automata |
D. | Turing Machine |
Answer» B. Deterministic pushdown automataDeterministic pushdown automataDeterministic pushdown automataDeterministic pushdown automataDeterministic pushdown automataDeterministic pushdown automataDeterministic pushdown automataDeterministic pushdown automata | |