Abstract syntax tree

en.wikipedia.org · 2,009 words · saved by 1 readers

An abstract syntax tree (AST) is a data structure used in computer science to represent the structure of a program or code snippet. It is a tree representation of the abstract syntactic structure of text (often source code) written in a formal language. Each node of the tree denotes a construct occurring in the text. It is sometimes called just a syntax tree.

Abstract syntax tree - Wikipedia Jump to content From Wikipedia, the free encyclopedia Tree representation of the abstract syntactic structure of source code For the trees used in linguistics, see parse tree . This article includes a list of references , related reading , or external links , but its sources remain unclear because it lacks inline citations . Please help improve this article by introducing more precise citations. ( February 2013 ) ( Learn how and when to remove this message ) An abstract syntax tree for the following code for the Euclidean algorithm : b:\n a := a - b\n else:\n b