abstract syntax tree

(redirected from Abstract syntax trees)

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.
In 2018, Lee's team also plans to explore (http://www.mit.edu/~jlrubin/public/pdfs/858report.pdf) Merkelized Abstract Syntax Trees , a way for cryptocurrencies such as bitcoin and litecoin to layer with smart contracts.
Uses covered include address syntax crunching unavailable with regular expressions tools; building compilers and interpreters; interpreting code, configuration files or other structured format; and key programming techniques, including abstract syntax trees and symbol tables.
Many compilers translate source programs into intermediate representations based on abstract syntax trees. Tree-oriented mobile code representations are derived from these internal data structures, linearized into a stream of binary data so that they can be transmitted in files or across the network.
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).
Our compression scheme is based on adaptive methods such as LZW[10], but has been tailored towards encoding abstract syntax trees rather than character streams.
The abstract syntax tree is then traversed and encoded into a stream of symbols from the evolving vocabulary.
The particular representations of the program source range from closely coupled to the source code (such as abstract syntax trees annotated with data and control flow information [6] to abstractions of the source code (such as flow graphs that combine data and control flow information [15, 16]).
Our recognition algorithm assumes that the program has been translated into an abstract syntax tree with frames used to represent each program action and its relationship to other actions.
Abstract syntax trees were devised as a compact alternative to parse trees.
We introduce a data structure, production trees, that are more compact than either abstract syntax trees or parse trees.