The DFA construction algorithm converts this parse tree into a set of states, as the previous column explains.

• 如前一篇专栏文章中所解释的,DFA构造算法将该解析树转换成一组状态。