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编写的程序也是解析树的列表,类似于前面所见的那些解析树列表。
Expands the concept of using the scheme language as an executable metalanguage as in the parse tree example for other programming languages 扩展了将scheme语言用作可执行元语言的概念(如解析树示例中所示),以便其他编程语言利用它。
The parser is the software that takes those meaningful words and builds a parse tree out of them by recognizing their type and purpose 解析器是一种软件,它从文本获得那些有意义的单词,并通过识别这些单词的类型与用途,从中构建解析树。
Moreover, we present an intermediate representation for parsing tree of cfl sentence that can be easily implemented and needs less space occupancy 此外,为上下文无关语言句子的分析树设计了一种简单表示形式,这种表示形式可以提高空间效率,并且易于实现。
As i mentioned above, a scheme program is just a collection of lists, and each list is a parse tree that is run through scheme s evaluator to produce a result 如前所述,一个scheme程序只不过是列表的集合,每个列表都是一个解析树,都通过scheme的求值程序生成一个结果。
On the basis of former analysis, structures and requirements of waper are introduced and the thesis lays eyes on the parsing tree technology and vision controlling technology 在对比分析上述浏览器的基础上,提出了waper的体系结构和设计需求,阐述了waper的功能和组成部分,并对waper的各组成部分的设计进行了描述。