For a given NFA, a DFA can be constructed to represent the same pattern as the NFA.

Question $3$ options:

True

False

Which of the following is NOT part of NFA definitions?

Question $4$ options:

A transition function

A set of states

A set of arcs

A set of final states

A set of input symbols

A start state

The construction of a lexical analyzer typically involves several steps. Please put these steps in the correct order.

Construction of NFA

Construction of DFA

Definition of token patterns using regular expression

Generation of the lexical analyzer from DFA

Question $6$ options:

$3,2,1,4$

$1,2,3,4$

$3,1,2,4$

$1,3,2,4$

An arc may go from one final state to another state in NFAs and DFAs.

Question $7$ options:

True

False

An NFA can be constructed to recognize the pattern of any given regular expression.

Question $8$ options:

True

False

What$$s the number of outgoing arcs of the final state of the NFA constructed using Thompson$$s construction on the regular expression $($ab$|$c$)*?$

Question $9$ options:

$4$

$1$

$0$

$3$

$2$

Which of the following is NOT true about NFA and DFA?

Question $10$ options:

For a given state and an input symbol, an NFA may reach multiple states, while a DFA can reach up to one state.

NFA and DFA have the same computational power.

A NFA may have $\backslash$epsi $-$transition, while DFA cannot have $\backslash$epsi $-$transition.

A NFA may have multiple final states, while a DFA can only have one final state.

A NFA is also a DFA.

Question $13$ options:

True

False

In the class, we discuss an algorithm to convert a NFA to an equivalent DFA. The constructed DFA from the algorithm always has one final state.

Question $15$ options:

True

False

A DFA is also an NFA.

Question $16$ options:

True

False

What$$s the number of outgoing arcs of the start state of the NFA constructed using Thompson$$s construction on the regular expression $($ab$|$c$)*?$

Question $18$ options:

$0$

$3$

$4$

$2$

$1$

Which of the following is NOT a responsibility of the Lexical Analyzer?

Question $19$ options:

Generating a sequence of tokens

Detecting comments and whitespaces like blank, newline and tab.

Detecting illegal characters

Keeping track of the line number

None of the above

The NFA constructed using Thompson$$s construction may have two or more final states.

Question $20$ options:

True

False