Abstract syntax tree: Difference between revisions

Revision as of 19:03, 1 November 2021

Revision as of 08:50, 2 November 2021

Line 3:

{{no footnotes|date=February 2013}}

{{Merge from|Abstract syntax|date=September 2021}}

[[File:Abstract syntax tree for Euclidean algorithm.svg|thumb|400px|An abstract syntax tree for the following code for the [[Euclidean algorithm]]:{{pre|1=''']]<syntaxhighlight>
while''' b ≠ 0<br>:
'''if''' a > b<br>:
a := a −- b<br>
'''else'''<br>:
b := b −- a<br>'''
return''' a}}]]

</syntaxhighlight>

In [[computer science]], an '''abstract syntax tree''' ('''AST'''), or just '''syntax tree''', is a [[Tree (data structure)|tree]] representation of the [[abstract syntax|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.