How can we get the Syntax Tree of a specific compiler?
我们怎样才能把一个特定编译器的语法树？
The first pass of the compiler turns this into a syntax tree.
编译器的首个编译过程会将其编译成语法树。
The syntax tree consists of syntax nodes, tokens, and trivia.
语法树是由语法节点、令牌和一些琐碎的内容(trivia)组成的。
Use the abstract syntax tree when you cannot use Eclipse markers.
当您不能使用Eclipse标记时可以使用抽象语法树。
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.
这一次，您可以读取抽象语法树中的所有导入声明了。
The structure of GCC syntax tree and its functions in compiling are introduced.
介绍了GCC抽象语法树的结构及在编译过程中的作用。
This method removes the need to manually copy the unchanged portions of the syntax tree.
这个方法让我们不需要手动复制语法树中没有变更的部分。
The recorder records code in an intermediate format, similar to an Abstract Syntax Tree.
录制器采用中间格式录制代码，类似于 抽象语法树。
A syntax tree can be created from an entire file or just a loose statement or expression.
我们可以从完整的文件创建语法树，也可以从松散的声明或者表达式生成它。
Language model; Long distance dependency; dependency syntax tree; Max entropy method.
语言模型；长距离依赖；依存句法树；最大熵策略！
Changes are made by making copies of the syntax tree, replacing portions as one goes along.
想要做出改变，我们需要复制语法树，并替换需要变更的部分。
Therefore, executing a bytecode instruction is much faster than visiting a syntax tree node.
因此，执行字节码指令要比访问语法树节点快得多。
You define a language by defining the structure of its abstract syntax tree, its abstract grammar.
定义语言就是定义它的抽象句法树，它的抽象文法。
Modifications are made to the syntax tree using a combination of constructors and the ReplaceNode method.
变更是针对语法树做出的，变更时会使用了构造器和ReplaceNode方法的组合。
This pattern is often reapplied several times through a rule as you dig down through an abstract syntax tree.
在您沿着抽象语法树深入时，该模式通常会通过一条规则重复应用几次。
Here other techniques such as compiling an abstract syntax tree and resolving variables in closures are discussed.
在这里，对其它技术(如：编译一个抽象语法树和解析闭包中的变量)也进行了讨论。
The analysis of the abstract syntax tree of the Groovy code, allows us to collect all relevant information we need.
对于Groovy代码的抽象语法树的分析，可以让我们搜集到我们需要的所有相关信息。
The sample project included with the CTP shows compiler warnings wherever the letter ‘a’ appears in the syntax tree.
在CTP版本中包含的实例为我们展示了，如何在语法树中出现字母“a”的地方显示警告。
Third, with the syntax tree gone, the interpreter no longer needs to propagate execution state between syntax tree nodes.
第三，由于不再需要语法树，解释器无需继续在语法树节点间传送执行状态。
Adopting bottom-up parsing algorithms, the parse analyse the sequence of tokens and form the syntax tree of EP program.
语法分析采用自底向上分析方法，根据语言语法分析标记序列，构建程序的语法树。
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 means any syntax tree can be turned back into source code, an important feature for code generators and refactoring tools.
这意味着所有语法树都能够转换回源代码，这对于代码生成器和重构工具都是非常重要的功能。
This is not a textual search, it actually strips out variable names and constants and performs comparisons against the syntax tree.
这并非只是简单的文本搜索，它实际上会提取出变量名和常量名，然后根据语法树进行比较。
Traverses the abstract syntax tree (AST) one or more times, collecting information and checking that the input program makes sense.
遍历抽象语法树(abstract syntax tree,AST)一次或多次，收集信息并检查输入程序makessense。
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)描述了非常相似的语法结构。
In IDEA and Eclipse, your code looks like a text view, but the development environment is actually editing the Abstract Syntax Tree (AST).
在idea和eclipse中，您的代码看上去像一个文本视图，但是开发环境实际上正在编辑AbstractSyntax Tree (ast)。
We analyzed the abstract syntax tree represent of GCC, the optimization on the call-graph, and the approach to the command-line arguments.
在此基础上，分析了GCC的前端树表示、基于调用图的优化模式、GCC的命令行参数处理机制，并提出了一个跨文件编译模式模型。
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。
Quick fixes are provided only with the violating ASTNode (the node from the abstract syntax tree) and the IDocument, which is the resource that holds the node.
快速修复只与违反ASTNode(来自抽象语法树的节点)以及IDocument，它是含有节点的资源。
应用推荐