一种将NFA到最小化DFA的方法

A Method of Alteration from NFA to Minimum-state DFA

词法分析是编译程序重要阶段,有效的词法分析可提高编译程序的效率。本文提出用子集方法完成NFA到DFA并使用树型分割法实现DFA到最小化DFA的化简。

It is very important phase for compiler to do lexical analysis Effective lexical analysis can improve the efficiency of compiler.This paper puts forward a method of finishing the alteration from NFA to DFA with subset,and implementing the alteration from DFA to minimum-state DFA with tree-splitting.