Later on we will combine token sequences into parse trees.
稍后我们会将记号序列组合成解析树。
You write programs in the parse trees that get generated within the compiler when other languages are parsed.
你写程序实际上是在写语法树-而其它语言需要编译器生成这种内部表示。
Treetop generates parse trees automatically but allows the user to customize the generated nodes by adding methods
Treetop会自动生成解析树，而且还允许用户添加方法来定制所生成的节点
What's really interesting is that a large part of the parse trees of different languages are actually very similar.
真正有趣之处在于，许多不同语言的大部分解析实际上是非常类似的。
Even the programs written in Scheme are merely lists that happen to also be parse trees, like the ones you played with previously.
甚至使用Scheme编写的程序也是解析树的列表，类似于前面所见的那些解析树列表。
It also serves as an example of my earlier contention that using parse trees makes debugging easier and consequently speeds development time.
它还充当了我以前的论点(使用解析树使调试更容易，从而缩短开发时间)的示例。
The syntax-aware reflow we use to wrap long lines is based on the parse trees (abstract syntax trees) for the language, and some other things need per-language customization.
语法感知的长句断行基于语言的解析树（抽象语法树），其他功能需要各个语言的定制。
Functional languages are used frequently for building compilers or tools that parse languages because languages are normally expressed as syntax trees.
函数性语言被频繁地用来构建编译器或者解析语言的工具，因为语言通常是用语法树表示的。
Stochastic Chomsky normal form (SCNF) is introduced to parse sentences with probabilistic CYK algorithm. The optimal parsing trees of sentences are gained to eliminate ambiguous meanings.
引入scnf语法，据此进行概率CYK剖析，得到句子的最佳剖析树以消除歧义。
Stochastic Chomsky normal form (SCNF) is introduced to parse sentences with probabilistic CYK algorithm. The optimal parsing trees of sentences are gained to eliminate ambiguous meanings.
引入scnf语法，据此进行概率CYK剖析，得到句子的最佳剖析树以消除歧义。
应用推荐