syntax tree

Pattern matching utilizes abstract syntax tree isomorphism algorithm; Pointer semantics determines the semantics of programs through semantic constraints to check out security vulnerabilities; Interprocedural analysis adopts summary-based context sensitive analysis.

模式匹配采用了抽象语法树同构判断算法；指针语义则是通过语义约束来确定程序唯一语义以达到检查安全漏洞的目的；跨过程分析采用基于总结的上下文敏感分析方法。

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

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

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

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

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

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

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

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

Build and Traverse of Abstract Syntax Tree Based on Java Program

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

It is the clear syntax tree front end, the highly recapitulative intermediate language and the concise machine description back end that help GCC port to kinds of platforms.

其清晰的前端语法树结构、高度概括的抽象机中间语言、简洁有力的后端机器描述等三部分为快速实现多语种开发、多平台移植提供了有力的支持。

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

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

The method includes: parsing tree path information based on a predetermined syntax if tree path information of an element is input;

该方法包括：如果输入元素的树状路径信息，则基于预定语法解析树状路径信息；

The reason is that the shortest dependency path has noise interference brought by the appositive dependency relation. The noise information not only increases the complexity of the syntax tree representation, but also hampers the recognition and judgment of a classifier.

原因是最短依存路径上存在同位语依存关系带来的噪音干扰，这种噪音信息不仅增加了句法树表示的复杂性，而且会妨碍分类器的识别和判断。

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

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