...
Software-Engineering
October 9, 2023
Compiler-Design
October 9, 2023
Software-Engineering
October 9, 2023
Compiler-Design
October 9, 2023

Phases-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?
A
Deterministic Push down Automata
B
Finite Automata
C
Non-Deterministic Finite Automata
D
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

Leave a Reply

Your email address will not be published. Required fields are marked *