abstract syntax tree


Also found in: Acronyms, Wikipedia.

abstract syntax tree

(compiler)
(AST) A data structure representing something which has been parsed, often used as a compiler or interpreter's internal representation of a program while it is being optimised and from which code generation is performed. The range of all possible such structures is described by the abstract syntax.
This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)
References in periodicals archive ?
Joust 0.[8.sup.2], a Java parser written in Objective Caml, is modified to parse Java sources and produce abstract syntax trees.
[34] proposes a Tree Kernel to compare abstract syntax trees that are a class of functions for computing similarity among information arranged.
An Automatic Refactoring Method of Cloned Code Using Abstract Syntax Tree and Static Analysis, Journal of Chinese Computer Systems, 28.
On the high level of abstraction, when working with abstract syntax tree, two passes where added: the pass for discovering loops that can be implemented as hardware loops, and the pass for usage of address generators.
Abstract syntax tree that is output of the frontend is loaded into the backend.
b) The abstract syntax tree generation constructs abstract syntax tree for the legacy application code in order to support various techniques of program understanding for discovering implicit structures and constraints.
A typical tree-oriented mobile code representations compilation unit consists of a source module's abstract syntax tree and symbol table of a program (which would typically be generated during the compilation of the source program even if native machine code were to be targeted) [12, 29, 39, 28].
Slim Binaries avoid these disadvantages by using a portable and high-level intermediate representation, that is based on the encoded abstract syntax tree and symbol table of a program.
Rather, every symbol in a slim binary describes a subtree of an abstract syntax tree in terms of all the subtrees that precede it in the file.
The recognition process next examines the while (a LOOP action in the program's abstract syntax tree).
Abstract syntax trees were devised as a compact alternative to parse trees.