Syntax tree

Analysis and Design of Code Smell Detection Tool Based on Abstract Syntax Tree

基于抽象语法树的代码味道识别工具的分析与设计

Design and Implementation of A Software Metrics Tool Based on Abstract Syntax Tree

基于抽象语法树的软件度量工具的设计与实现

Use the abstract syntax tree when you cannot use Eclipse markers

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

Build and Traverse of Abstract Syntax Tree Based on Java Program

基于Java语言的抽象语法树的创建与遍历

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

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

A Static Checking Method of Array Access Violation Based on Abstract Syntax Tree

基于抽象语法树的数组越界的静态检测方法

Storage Mapping of Syntax Tree for Context-Free Language and its Application

一种上下文无关语言语法树的存储模式及其应用

Analysis of the C + + Source Program Structure Based on GCC Abstract Syntax Tree

基于GCC的抽象语法树对C++源程序结构的分析

This thesis designed an abstract syntax tree based on statement for software reverse engineering .

为适应逆向工程的需求，本文研究和设计了一棵以语句为基本单元的语法分析树。

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 .

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

The structure of GCC syntax tree and its functions in compiling are introduced .

介绍了GCC抽象语法树的结构及在编译过程中的作用。

Abstract Syntax Tree , referred as intermediate representation of program , has many applications in Program Analysis .

抽象语法树（AbstractSyntaxTree，AST）作为程序的一种中间表示形式，在程序分析等诸多领域有广泛的应用。

A storage mapping of G tree of syntax tree in relational databases is represented .

针对上下文无关语言的句子所对应的语法树G树的表示形式提出了一种关系数据库的存储形式。

The interpreter has two components : Syntactic parser and Syntax tree interpreter .

CNLInterpreter有两部分组成：句法剖析器和语法树解释器。

A Method for Parsing GCC abstract Syntax Tree

一种解析GCC抽象语法树的方法

The syntax tree is gained during parsing web resources by means of using heap and stack .

在解析网页资源的过程中，通过使用堆栈来进行相关的操作，得到了所需的语法树。

The generation of control flow graph is according to preorder traverse of the syntax tree .

控制流图的生成是通过对构件语法树进行先序遍历完成的。

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

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

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

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

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

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

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 .

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

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

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

The syntax tree consists of syntax nodes , tokens , and trivia .

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

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

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

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

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

In terms of common data query , using the syntax tree to semantic optimization ; Using memory database to merge multiple source results .

在小数据查询方面，利用语法树进行语义优化；利用内存数据库实现多数据源结果集合并。

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

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

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

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