Compiler-Design
January 3, 2025Algorithms
January 3, 2025GATE 2011
|
Question 7
|
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?
|
Finite state automata
|
|
|
Deterministic pushdown automata
|
|
|
Non-Deterministic pushdown automata
|
|
|
Turing machine
|
Question 7 Explanation:
Lexical Analysis is implemented by finite automata.
Correct Answer: A
Question 7 Explanation:
Lexical Analysis is implemented by finite automata.
Subscribe
Login
0 Comments