For HC, the parse tree represents an XPath.
对于HC，该解析树表示一个XPath。
The DFAFactory class compiles a DFA from the parse tree.
DFAFactory类从该解析树编译dfa。
Your application could do more interesting things with the parse tree.
您的应用程序可以用解析树做更多有趣的事情。
A Doclet has a static start method and takes the parse tree as an argument.
Doclet有静态start方法，并将解析树作为参数。
InfoQ: With the ParseTree gem, one can access the parse tree of a class or method.
InfoQ：我们可以使用ParseTreegem包访问一个类或一个方法的解析树。
Write client-side code to walk and evaluate the parse tree that's produced at runtime.
编写客户机端代码以遍历在运行时生成的解析树并对其求值。
Given the parse tree, you apply the algorithm in Listing 3 to compute the transition function.
给定解析树，可以应用清单3中的算法来计算转换函数。
Working with a parse tree representation also makes debugging easy and speeds development time.
使用解析树表示还会使调试变得更容易，并缩短开发时间。
I'll explore that in more detail once you've looked at JJTree and its parse tree representations.
当您研究过JJTree及其解析树表示后，我将对此做更详细的研究。
The first approach is to delay all semantic actions until the whole parse tree is constructed.
第一种做法是延迟所有语意动作，直到建立完整的剖析树。
I'll come back to this in more detail when I talk about the JJTree tool and parse tree representations in Part 2.
在第2部分谈论有关JJTree工具和解析树表示时，我将回过头来更详细地讨论这一内容。
The method accepts a parse tree (as an XPathNode object) as parameter and, for now, returns an instance of DFATable.
目前，该方法接受解析树（作为一个XPathNode对象）作为参数，并返回DFATable的实例。
Usually, using SimpleParse means generating a parse tree in one function call, then traversing this tree in separate code.
一般来说，使用SimpleParse就意味着在一个函数调用中生成一个解析树，然后在分开的代码中遍历这个树。
From the discussion in the last column, you may recall that the algorithm to construct a DFA expects a parse tree as input.
从上一篇专栏文章所讨论的内容中，您可以回忆起，构造DFA的算法需要一棵解析树作为输入。
The axpath() method returns what is known as an augmented parse tree -- a parser tree with one extra node for the END_MARK.
axpath()方法返回称之为扩张的解析树 ―该解析树额外地带有一个表示 END_MARK 的节点。
The parser is the software that takes those meaningful words and builds a parse tree out of them by recognizing their type and purpose.
解析器是一种软件，它从文本获得那些有意义的单词，并通过识别这些单词的类型与用途，从中构建解析树。
The alternative (not explored here) is for productions to contribute only SimpleNode nodes to the parse tree and not subclasses thereof.
备用方法(不在这里研究)是结果只将SimpleNode节点提供给解析树，而不是它的子类。
Compared with the conventional parse tree, this representation not only consumes less space, but also is faster for structure matching.
这种表示比传统分析树不仅空间较小，而且进行结构匹配的速度快。
Target parsing can be reasonably fast and does not generate a memory-consuming parse tree, but all events fire for all elements in the data.
目标解析可以实现合理的速度并且不会生成消耗内存的解析树，但是在数据中为所有元素触发事件。
I'll note before we go any further that the terms parse tree and abstract syntax tree (or AST) describe very similar grammatical structures.
在我们继续之前，我要特别提一下，术语解析树和抽象语法树(或ast)描述了非常相似的语法结构。
Walking through the parse tree at runtime with a good debugger is another invaluable adjunct to understanding how tree building works in JJTree.
使用好的调试器在运行时遍历解析树是另一个宝贵的辅助方法，它有助于理解树构建在JJTree中是如何工作的。
ParseTree is a library that allows to access the parse tree of Ruby code - either Ruby source code or Ruby code already loaded in the interpreter.
ParseTree是一个用来访问Ruby代码解析树的程序库，这个Ruby代码可以是源代码，也可以是已经加载到解释器的代码（即实时访问）。
The most important ones for HC are RootDoc, ClassDoc, and MethodDoc; they return information on the parse tree, classes, and methods, respectively.
用于HC的最重要的类有： RootDoc 、ClassDoc和MethodDoc ；它们分别返回有关解析树、类和方法的信息。
ParseTree's raw output is close to Ruby's internal parse tree; Unified Ruby is a cleaned up and simplified version of the normal output of ParseTree.
ParseTree的原始输出类似于Ruby的内部解析树；unifiedruby则是ParseTree默认输出的经过清理的简化版本。
This article compares the effects of different management measures on biomass and growth of larch by analyzing the parse tree based on researching the sample.
本文在区域样地调查基础上，通过解析木分析，比较了不同经营措施对落叶松种群生物量和生长量的影响。
On the technical side, Blue Ruby is using parse tree to produce BRIL code (ABAP VM bytecode). Blue Ruby takes care of security using a bridge and a virtual file system.
从技术的角度看，BlueRuby用parse tree来生成BRIL代码(ABAPVM的字节码)，用桥和虚拟文件系统来保证安全。
By adding auxiliary calculating information into parse tree nodes, formula string input by users is converted into temporary codes; finally we get the correct result.
公式计算是通过在公式语法解析返回的语法树的结点中添加辅助计算信息，将用户输入的公式串转换成中间代码，最后得到公式计算结果。
Since they have access to the entire parse tree (minus the actual method body), Doclets provide a handy mechanism to compile utility classes or compile reports on the code.
因为它们有权访问整个解析树(除去实际方法主体)，所以Doclet提供了一个简便机制来编译有关代码的实用程序类或报告。
With everything you've done so far, however, you still don't have quite enough information to calculate the results of the arithmetic operation represented by this parse tree.
即使到目前为止您已经执行了所有操作，但您仍然没有足够的信息来计算该解析树表示的算术运算的结果。
With everything you've done so far, however, you still don't have quite enough information to calculate the results of the arithmetic operation represented by this parse tree.
即使到目前为止您已经执行了所有操作，但您仍然没有足够的信息来计算该解析树表示的算术运算的结果。
应用推荐