Construct a transition table for the following Non$-$deterministic Finite Automata $($NFA$)$ for strings containing $\{0,1\}$ :

$\backslash$table$[[$Major Topic,$\backslash$table$[[$Elooms$],[$Desienation$],[$UN$]],\backslash$table$[[$Scare$],[5]]]]$

PART B

THREE QUESTIONS ANSWER TWO

Question $6$

a$).$ Lexical analyzers are very crucial in the program compilation process. Describe four functions that the lexical analyzers perform in the compilation process.

b$)$ As human as programmers are, their programs often have inherent errors that compilers identify. Explain the four kinds of errors that a program may have at various stages of the compilation process.

$$ Introduction &$.$ Phases of a Compiler

Ehogre: $$

sone

Errignation

war

AS