Conversion of an NFa to a dFa initially,e-closure(so)is the only state in Dstates,and it is unmarked; while there is an unmarked state T in Dstates ) mark T; for each input symbol a ) U=e-closure(move(T,a)); if (U is not.in Dstates) add U as an unmarked state to Dstates; DtranT,a]=U; CS308 Compiler TheoryConversion of an NFA to a DFA CS308 Compiler Theory 13