The first pass of the compiler turns this into a syntax tree.
编译器的首个编译过程会将其编译成语法树。
An abstract syntax tree is an expression represented as a collection of objects.
抽象语法树是一个表示为对象集合的表达式。
This time, you will fetch all of the import statements in the abstract syntax tree.
这一次，您可以读取抽象语法树中的所有导入声明了。
Therefore, executing a bytecode instruction is much faster than visiting a syntax tree node.
因此，执行字节码指令要比访问语法树节点快得多。
This method removes the need to manually copy the unchanged portions of the syntax tree.
这个方法让我们不需要手动复制语法树中没有变更的部分。
Here other techniques such as compiling an abstract syntax tree and resolving variables in closures are discussed.
在这里，对其它技术(如：编译一个抽象语法树和解析闭包中的变量)也进行了讨论。
Changes are made by making copies of the syntax tree, replacing portions as one goes along.
想要做出改变，我们需要复制语法树，并替换需要变更的部分。
A syntax tree can be created from an entire file or just a loose statement or expression.
我们可以从完整的文件创建语法树，也可以从松散的声明或者表达式生成它。
You define a language by defining the structure of its abstract syntax tree, its abstract grammar.
定义语言就是定义它的抽象句法树，它的抽象文法。
Use the abstract syntax tree when you cannot use Eclipse markers.
当您不能使用Eclipse标记时可以使用抽象语法树。
This pattern is often reapplied several times through a rule as you dig down through an abstract syntax tree.
在您沿着抽象语法树深入时，该模式通常会通过一条规则重复应用几次。
This is not a textual search, it actually strips out variable names and constants and performs comparisons against the syntax tree.
这并非只是简单的文本搜索，它实际上会提取出变量名和常量名，然后根据语法树进行比较。
This means any syntax tree can be turned back into source code, an important feature for code generators and refactoring tools.
这意味着所有语法树都能够转换回源代码，这对于代码生成器和重构工具都是非常重要的功能。
Modifications are made to the syntax tree using a combination of constructors and the ReplaceNode method.
变更是针对语法树做出的，变更时会使用了构造器和ReplaceNode方法的组合。
The sample project included with the CTP shows compiler warnings wherever the letter ‘a’ appears in the syntax tree.
在CTP版本中包含的实例为我们展示了，如何在语法树中出现字母“a”的地方显示警告。
The analysis of the abstract syntax tree of the Groovy code, allows us to collect all relevant information we need.
对于Groovy代码的抽象语法树的分析，可以让我们搜集到我们需要的所有相关信息。
The Erlang language (developed by Ericsson) USES a VM to execute Erlang bytecodes and also to interpret Erlang from the source's abstract syntax tree.
Erlang语言(由Ericsson开发)使用一个VM来执行erlangbytecodes，且通过源的抽象语法树解译erlang。
Writes the output tree according to the HTML or XML syntax
根据HTML或者XML语法写入输出树。
Language model; Long distance dependency; dependency syntax tree; Max entropy method.
语言模型；长距离依赖；依存句法树；最大熵策略！
The structure of GCC syntax tree and its functions in compiling are introduced.
介绍了GCC抽象语法树的结构及在编译过程中的作用。
With the emphasis on the abstraCt syntax tree (AST), the paper also discusses the structure of a disk file as well as the functions designed for saving and recovering the AST.
主要分析了抽象语法树(ast)，讨论了磁盘文件的结构及ast的写入和复原技术。
Strictly speaking, the AST (abstract syntax tree) is also an IR (intermediate representation) - since it is not quite the source, and not quite the target language.
严格说来，AST(抽象语法树)也是一种IR——因为它既不是源代码，也不是目标语言。
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)描述了非常相似的语法结构。
The syntax tree consists of syntax nodes, tokens, and trivia.
语法树是由语法节点、令牌和一些琐碎的内容(trivia)组成的。
Third, with the syntax tree gone, the interpreter no longer needs to propagate execution state between syntax tree nodes.
第三，由于不再需要语法树，解释器无需继续在语法树节点间传送执行状态。
You can also use an XPath syntax to retrieve the contents of a message. The following Java code accesses the first chapter element in the logical tree using the XPath syntax.
您还可以使用xpath语法来检索消息的内容。
In DOM, the document is modeled as a tree, where each component of the XML syntax (such as an element or text content) is represented by a node.
在DOM 中，文档被模型化为一棵树，其中每个XML语法成分（如元素和文本内容）都用一个节点表示。
Because the workspace model is a lot like an XML document in that it is a tree structure, XPath is an ideal syntax for finding nodes.
因为从树形结构来看，工作区模型非常类似于XML文档，所以XPath是查找节点的理想语法。
In order to effectively direct the translation process by syntax information, a greedy direct decoding algorithm is proposed for the syntax-based tree-to-string statistical translation model.
为了有效利用句法信息指导翻译过程，提出了基于贪心搜索的树-串句法统计翻译模型的正向解码算法。
SquirrelFish differs from the previous implementation of the interpreter in that it uses a bytecode based strategy rather than syntax tree-walking interpretation.
与之前的解释器使用遍历语法树的实现方式不同的是，SquirrelFish的实现采用字节码。
应用推荐