Software-Engineering
October 9, 2023Phases-of-Compilers
October 9, 2023Phases-of-Compilers
|
Question 5
|
Which of the following machine model can be used in a necessary and sufficient sense for lexical analysis in modern computer language?
|
Deterministic Push down Automata
|
|
|
Finite Automata
|
|
|
Non-Deterministic Finite Automata
|
|
|
Turing Machine
|
Question 5 Explanation:
Lexical Analysis is implemented by using finite automata or Regular Expression
Correct Answer: B
Question 5 Explanation:
Lexical Analysis is implemented by using finite automata or Regular Expression
Subscribe
Login
0 Comments