the dfa construction algorithm converts this parse tree into a set of states, as the previous column explains 如前一篇专栏文章中所解释的,dfa构造算法将该解析树转换成一组状态。
for more on the front end and back end to return a parse tree that contains all the xpaths to recognize 以了解更多有关前端和后端的信息)返回一个包含所有要识别的xpath的解析树。
what s really interesting is that a large part of the parse trees of different languages are actually very similar 真正有趣之处在于,许多不同语言的大部分解析实际上是非常类似的。
the algorithm essentially computes all the possible stack configurations that could lead to a given node in the parse tree 该算法必须计算所有可能的、可通向解析树中给定节点的堆栈配置。
even the programs written in scheme are merely lists that happen to also be parse trees, like the ones you played with previously 甚至使用scheme编写的程序也是解析树的列表,类似于前面所见的那些解析树列表。