Question

7. In lexical analysis of a
compiler_is used.
O a) DFA
O b) NDFA
O c) NFA
O d) Turing machine​

Answer 1

Answer:

B )NFA

Explanation:

Lexical analysis is the first step in compilation. In lexical analysis, program is divided into tokens. Lexical analyzers are typically based on finite state automata. Tokens can typically be expressed as different regular expressions:

An identifier is given by [a-zA-Z][a-zA-Z0-9]*

The keyword if is given by if.

Integers are given by [+-]?[0-9]+.

Answer 2

ANSWER

the answer is

(a)DFA

See the attachment to get proof