Use the abstract syntax tree when you cannot use Eclipse markers

当您不能使用Eclipse标记时可以使用抽象 语法 树

This means any syntax tree can be turned back into source code an important feature for code generators and refactoring tools .

这意味着所有 语法 树都能够转换回源代码，这对于代码生成器和重构工具都是非常重要的功能。

An abstract syntax tree is an expression represented as a collection of objects .

抽象 语法 树是一个表示为对象集合的表达式。

For that you would turn to something quite familiar to compiler aficionados : the JDT 's Abstract Syntax Tree ( AST ) framework .

因为您会转而使用一些对编译器迷而言十分熟悉的工具：JDT的抽象 语法 树（Abstract Syntax Tree，AST）框架。

This pattern is often reapplied several times through a rule as you dig down through an abstract syntax tree .

在您沿着抽象 语法 树深入时，该模式通常会通过一条规则重复应用几次。

You define a language by defining the structure of its abstract syntax tree its abstract grammar .

定义语言就是定义它的抽象 句法 树，它的抽象文法。

To avoid this flaw you will reconstruct the rule by using Java 's abstract syntax tree ( AST ) to identify the problems .

为了避免这种缺陷，您可以使用Java的抽象 语法 树（AST）来识别这种问题，从而重新构筑规则。

If a sentential form is ambiguous then it has more than one syntax tree and therefore in general more than one handle .

如果句型是二义性的，那末，它不只有一 棵 语法 树，因此，一般地说，也不只有一个句柄。

A lack of a pure Ruby parser has been negligible for some time in Ruby 's history since getting the Abstract Syntax Tree ( AST ) of some Ruby code was possible with utilities such as ParseTree .

因为可以使用类似 语法分析 树（ParseTree）的通用方法来对Ruby代码进行分析并获得抽象 语法 树（Abstract Syntax Tree），所以在Ruby历史上的一定时期内，纯Ruby语法分析器的缺失被忽视了。

This method removes the need to manually copy the unchanged portions of the syntax tree .

这个方法让我们不需要手动复制 语法 树中没有变更的部分。

The first pass of the compiler turns this into a syntax tree .

编译器的首个 编译过程会将其编译 成语 法 树。

This paper introduced a kind of variable type collecting method which is based on layered thoughtway and abstract syntax tree .

提出了一种基于分层思想的，并且无需构造具体 语法 树的变量类型提取方法。

You can add new rules either by writing Java code and recompiling PMD or a little more simply by writing XPath expressions that are resolved against each Java class 's abstract syntax tree .

您可以添加新规则：可以通过编写Java代码并重新编译PDM，或者更简单些，编写XPath表达式，它会针对每个Java类的抽象 语法 树进行处理。

Automatic Refactoring Method of Cloned Code Using Abstract Syntax Tree and Static Analysis

使用抽象 语法 树和静态分析的克隆代码自动重构方法

Modifications are made to the syntax tree using a combination of constructors and the ReplaceNode method .

变更是针对 语法 树做出的，变更时会使用了构造器和ReplaceNode方法的组合。

This is not a textual search it actually strips out variable names and constants and performs comparisons against the syntax tree .

这并非只是简单的文本搜索，它实际上会提取出变量名和常量名，然后根据 语法 树进行比较。

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。

Do you translate command-by-command or do you build the full Abstract Syntax Tree and optimize on that as GWT does for translating Java to JavaScript ?

是一条命令接着一条命令地转还是先构建出完整的抽象 语法 树并对其优化呢，就像GWT将Java转换为JavaScript那样？

The syntax tree consists of syntax nodes tokens and trivia .

语法 树是由语法节点、令牌和一些琐碎的内容（trivia）组成的。

It suffices to say here that when this rule eventually runs a target C + + operation will have been created already in the abstract syntax tree mentioned earlier .

在这里就可以说明，该规则什么时候起效，在上面提到过的抽象 语法 树状 结构中，已经创建了一个目标C++操作。

Because you have defined this extension to be invoked when the transformation is processing a UML class you can safely type the target object to an Abstract Syntax Tree ( AST ) TypeDeclaration object .

因为当转换处理UML类时，您已经定义调用该扩展，所以您可以安全地向Abstract Syntax Tree（AST）TypeDeclaration对象输入目标对象。

The analysis of the abstract syntax tree of the Groovy code allows us to collect all relevant information we need .

对于Groovy代码的抽象 语法 树的分析，可以让我们搜集到我们需要的所有相关信息。

Changes are made by making copies of the syntax tree replacing portions as one goes along .

想要做出改变，我们需要复制 语法 树，并替换需要变更的部分。

There are workarounds like Ryan Davis'ParseTree which uses the parser of Ruby 's interpreter ( via a native extension ) to get at the Abstract Syntax Tree ( AST ) for Ruby source .

有些工作，像RyanDavis的分析树，用的是Ruby解释器的分析器（通过一个本地扩展）来获得Ruby源码的抽象 语法 树（AST）。

Here other techniques such as compiling an abstract syntax tree and resolving variables in closures are discussed .

在这里，对其它技术（如：编译一个抽象 语法 树和解析闭包中的变量）也进行了讨论。

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）描述了非常相似的语法结构。

As input a sentence if the sentence is lawful sentence corresponding output syntax tree to the output of the process every step of the sign changes in the stack .

如输入一个句子，如果该句子合法则输出与句子对应的 语法 树；能够输出分析过程中每一步符号栈的变化情况。

Therefore executing a bytecode instruction is much faster than visiting a syntax tree node .

因此，执行字节码指令要比访问 语法 树节点快得多。

This time you will fetch all of the import statements in the abstract syntax tree .

这一次，您可以读取抽象 语法 树中的所有导入声明了。

A syntax tree can be created from an entire file or just a loose statement or expression .

我们可以从完整的文件创建 语法 树，也可以从松散的声明或者表达式生成它。