前端组件用来解析源码并生成抽象语法树。
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 first pass of the compiler turns this into a syntax tree.
语法树只能够表现出源代码的词法和句法结构。
Syntax trees only represent the lexical and syntactic structure of the source code.
这一次，您可以读取抽象语法树中的所有导入声明了。
This time, you will fetch all of the import statements in the abstract syntax tree.
录制器采用中间格式录制代码，类似于抽象语法树。
The recorder records code in an intermediate format, similar to an Abstract Syntax Tree.
我们怎样才能把一个特定编译器的语法树？
这个方法让我们不需要手动复制语法树中没有变更的部分。
This method removes the need to manually copy the unchanged portions of the 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.
想要做出改变，我们需要复制语法树，并替换需要变更的部分。
Changes are made by making copies of the syntax tree, replacing portions as one goes along.
介绍了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.
语法分析根据词法分析器提供的语法单元构造查询的语法树。
Lexic analysis constructs query semantic tree according to the semantic unit which lexic analyzer provides.
语法树是由语法节点、令牌和一些琐碎的内容(trivia)组成的。
The syntax tree consists of syntax nodes, tokens, and trivia.
我们可以从完整的文件创建语法树，也可以从松散的声明或者表达式生成它。
A syntax tree can be created from an entire file or just a loose statement or expression.
第三，由于不再需要语法树，解释器无需继续在语法树节点间传送执行状态。
Third, with the syntax tree gone, the interpreter no longer needs to propagate execution state between syntax tree nodes.
编译集是基于一个或多个语法树、一组引用的集合以及所有编译器标识创建的。
A compilation is created from one or more syntax trees, a collection of references, and any compiler flags.
你写程序实际上是在写语法树-而其它语言需要编译器生成这种内部表示。
You write programs in the parse trees that get generated within the compiler when other languages are parsed.
在这里，对其它技术(如：编译一个抽象语法树和解析闭包中的变量)也进行了讨论。
Here other techniques such as compiling an abstract syntax tree and resolving variables in closures are discussed.
语法分析器完成词法分析和语法分析，建立具有多维语法结构的语法树。
The syntactic analyzer makes lexical analysis and syntactic analysis on the query, and sets up syntactic tree from the structure of the query.
他们可以通过把语法树回馈给编译集来创建语义模型，从而用符号数据对其进行注解。
A semantic model is created by feeding a syntax tree back into the compilation so that it will be annotated with symbol data. The semantic model can then be queried for information such as.
语法感知的长句断行基于语言的解析树（抽象语法树），其他功能需要各个语言的定制。
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.
对于Groovy代码的抽象语法树的分析，可以让我们搜集到我们需要的所有相关信息。
The analysis of the abstract syntax tree of the Groovy code, allows us to collect all relevant information we need.
变更是针对语法树做出的，变更时会使用了构造器和ReplaceNode方法的组合。
Modifications are made to the syntax tree using a combination of constructors and the ReplaceNode method.
这并非只是简单的文本搜索，它实际上会提取出变量名和常量名，然后根据语法树进行比较。
This is not a textual search, it actually strips out variable names and constants and performs comparisons against the syntax tree.
函数性语言被频繁地用来构建编译器或者解析语言的工具，因为语言通常是用语法树表示的。
Functional languages are used frequently for building compilers or tools that parse languages because languages are normally expressed as syntax trees.
严格说来，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.
在CTP版本中包含的实例为我们展示了，如何在语法树中出现字母“a”的地方显示警告。
The sample project included with the CTP shows compiler warnings wherever the letter ‘a’ appears in the syntax tree.
应用推荐