Definition of Abstract syntax tree

Search Dictionary
Abstract syntax tree Definition from Language, Idioms & Slang Dictionaries & Glossaries
hEnglish - advanced version

abstract syntax tree
(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.

Abstract syntax tree Definition from Encyclopedia Dictionaries & Glossaries
Wikipedia English - The Free Encyclopedia
[File:Abstract syntax tree for Euclidean algorithm.svg|thumb|400px|An abstract syntax tree for the following code for the Euclidean algorithm:
while b ≠ 0
if a > b
a := a − b
else
b := b − a
return a
]] 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.

See more at Wikipedia.org...
© This article uses material from Wikipedia® and is licensed under the GNU Free Documentation License and under the Creative Commons Attribution-ShareAlike License