For HC, the parse tree represents an XPath.
对于HC，该解析树表示一个XPath。
Figure 2: Parse tree for an addition operation.
图2：加法操作的解析树。
Picture of parse tree for an addition operation.
加法操作的解析树的图片。
A special node to mark the end of the parse tree.
标志解析树结束的特殊节点。
Figure 1: Parse tree for a single integer expression.
图1：单个整数表达式的解析树。
Picture of parse tree for a single integer expression.
单个整数表达式的解析树的图片。
The DFAFactory class compiles a DFA from the parse tree.
DFAFactory类从该解析树编译dfa。
The main classes are RootDocs that contain the parse tree.
主要的类是包含解析树的RootDoc 。
In the parse tree, it corresponds to hitting the END_MARK.
在解析树中，它对应于命中END_MARK。
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包访问一个类或一个方法的解析树。
The stap process begins with a translation of the script into a parse tree (pass 1).
stap流程从将脚本转换成解析树开始(pass 1)。
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.
第一种做法是延迟所有语意动作，直到建立完整的剖析树。
In other words, this governs the shape and content of the parse tree that's constructed by the parser.
换句话说，该构造管理由解析器构造的解析树的形状和内容。
InfoQ: How did you make your technical choice like using parse tree for parsing and building AST Ruby?
InfoQ：你如何做技术上的选择，比如解析使用parse tree，以及构建ASTRuby ？
The DFA construction algorithm converts this parse tree into a set of states, as the previous column explains.
如前一篇专栏文章中所解释的，DF A构造算法将该解析树转换成一组状态。
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的实例。
InfoQ: Could you tell us the advantage of using JRuby over parse tree or any other solutions, to exploit Ruby code?
InfoQ：你能告诉我们使用JRuby而不是parse tree或者其他解决方案来解析ruby代码的优势吗？
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节点提供给解析树，而不是它的子类。
The alternative (not explored here) is for productions to contribute only SimpleNode nodes to the parse tree and not subclasses thereof.
备用方法(不在这里研究)是结果只将SimpleNode节点提供给解析树，而不是它的子类。
应用推荐