In computer science, an abstract syntax tree (AST), or just syntax tree, is a tree representation of the abstract syntactic structure of source code written in a programming language. Each node of the tree denotes a construct occurring in the source code. The syntax is 'abstract' in the sense that it does not represent every detail that appears in the real syntax. For instance, grouping parentheses are implicit in the tree structure, and a syntactic construct such as an if-condition-then expression may be denoted by a single node with two branches.
This makes abstract syntax trees different from concrete syntax trees, traditionally called parse trees, which are often built by a parser as part of the source code translation and compiling process. Once built, additional information is added to the AST by subsequent processing, e.g., contextual analysis.
Abstract syntax trees are also used in program analysis and program transformation systems.
Famous quotes containing the words abstract and/or tree:
“The Germans are always too late. They are late, like music, which is always the last of the arts to express a world condition,—when that world condition is already in its final stages. They are abstract and mystical.”
—Thomas Mann (1875–1955)
“A tree may grow a thousand feet tall, but its leaves will return to its roots.”
—Chinese proverb.