前端组件用来解析源码并生成抽象语法树。
The front-end component handles the parsing of source code and the generation of abstract syntax trees.
抽象语法树是一个表示为对象集合的表达式。
An abstract syntax tree is an expression represented as a collection of objects.
录制器采用中间格式录制代码，类似于抽象语法树。
The recorder records code in an intermediate format, similar to an Abstract Syntax Tree.
这一次，您可以读取抽象语法树中的所有导入声明了。
This time, you will fetch all of the import statements in the abstract syntax tree.
它们包含相似的方法并创建相似的抽象语法树(ast)。
They contain similar methods and create similar abstract syntax trees (ASTs).
当您不能使用Eclipse标记时可以使用抽象语法树。
Use the abstract syntax tree when you cannot use Eclipse markers.
介绍了GCC抽象语法树的结构及在编译过程中的作用。
The structure of GCC syntax tree and its functions in compiling are introduced.
在您沿着抽象语法树深入时，该模式通常会通过一条规则重复应用几次。
This pattern is often reapplied several times through a rule as you dig down through an abstract syntax tree.
所有这些分析器提供了不同的抽象语法树以及获取它们的方式。
All of these provide different ASTs and different ways of getting at it.
在这里，对其它技术(如：编译一个抽象语法树和解析闭包中的变量)也进行了讨论。
Here other techniques such as compiling an abstract syntax tree and resolving variables in closures are discussed.
对于Groovy代码的抽象语法树的分析，可以让我们搜集到我们需要的所有相关信息。
The analysis of the abstract syntax tree of the Groovy code, allows us to collect all relevant information we need.
严格说来，AST(抽象语法树)也是一种IR——因为它既不是源代码，也不是目标语言。
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.
语法感知的长句断行基于语言的解析树（抽象语法树），其他功能需要各个语言的定制。
The syntax-aware reflow we use to wrap long lines is based on the parse trees (abstract syntax trees) for the language, and some other things need per-language customization.
主要分析了抽象语法树(ast)，讨论了磁盘文件的结构及ast的写入和复原技术。
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.
给出解析抽象语法树所使用的词法规则和语法规则，提出了解析gcc抽象语法树的方法。
Lexical rules and syntax rules used for parsing syntax trees are given, and a method for parsing GCC is proposed.
快速修复只与违反ASTNode(来自抽象语法树的节点)以及IDocument，它是含有节点的资源。
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.
在我们继续之前，我要特别提一下，术语解析树和抽象语法树(或ast)描述了非常相似的语法结构。
I'll note before we go any further that the terms parse tree and abstract syntax tree (or AST) describe very similar grammatical structures.
遍历抽象语法树(abstract syntax tree,AST)一次或多次，收集信息并检查输入程序makessense。
Traverses the abstract syntax tree (AST) one or more times, collecting information and checking that the input program makes sense.
因为您会转而使用一些对编译器迷而言十分熟悉的工具：JDT的抽象语法树(Abstract Syntax Tree,AST)框架。
For that, you would turn to something quite familiar to compiler aficionados: the JDT's Abstract Syntax Tree (AST) framework.
Erlang语言(由Ericsson开发)使用一个VM来执行erlangbytecodes，且通过源的抽象语法树解译erlang。
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.
纯ruby语法分析器提供了改变这种情况的机会——Ruby IDE(或者其他工具)可以获得Ruby的抽象语法树，同时避免被绑定到特定的语法分析器实现上。
The pure Ruby parser now offers a chance to change that - a Ruby IDE or other tool, can now get at a Ruby AST without getting locked in.
因为可以使用类似语法分析树(ParseTree)的通用方法来对Ruby代码进行分析并获得抽象语法树(Abstract Syntax Tree)，所以在Ruby历史上的一定时期内，纯ruby语法分析器的缺失被忽视了。
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语法分析器的缺失被忽视了。
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.
应用推荐