syntax tree

syntax tree

(mathematics, theory, language)
A tree representing the abstract syntax of some tokens in a language.
References in periodicals archive ?
In this fix, it will perform small code modifications to the abstract syntax tree. It will make adjustments to the patch until it finds a potential solution.
Taxonomy of clone detection tools Classification Comparison unit Available tools String-based Character diff in UNIX Token-based Token Baker's Dup [1], CP-Miner [4], CCFinder [3], Iclone [15] Tree-based AST Yang's [7], (abstract syntax tree) Baxter et al.'s CloneDR[R] [6], Jiang et al's DECKARD [5], Evans et al.'s Asta [8], Bulychev et al.'s CloneDigger [16], Lee and Doh's [9] Metric-based Metric values Mayrand et al.
The parser parses the Umple file and constructs the syntax tree model.
Abstract syntax tree based approach converts source code into an abstract syntax tree and traverse the tree for finding a similar sub tree.
Information produced by the frontend is loaded in backend in form of abstract syntax tree, and subsequently converted to target independent tree-like IR.
An expression that defines a circuit represents a program in a form of a syntax tree, which is the basic representation of a genotype in GP.
meaning of sentences is the syntax tree, which can relate a great deal
The first step on the producer side is to analyze the input program syntactically and semantically and to transform it into an abstract syntax tree (AST).
While these algorithms decrease the time required to parse a program after a change has been made to its text, they do not materialize the persistent syntax tree required in most applications of incremental parsing.
The abstract syntax tree is then traversed and encoded into a stream of symbols from the evolving vocabulary.
The only place in which we pose a text-matching query or name a structural component is at the leaves of the query syntax tree. These leaves must be solved with some sort of index and converted to a set of structure nodes.
MECDS method supplements the schema refinement step of DBRE with new algorithms to recover implicit constructs from DDL code, program, represented by abstract syntax tree, and data.