Abstract syntax tree: Difference between revisions

Revision as of 12:10, 29 July 2004

Revision as of 04:37, 24 August 2004

Line 1:

[[Category:Trees (structure)]]

[[Category:Formal languages]]

In [[computer science]], '''abstract syntax tree''' (AST) is a [[data structure]] representing something which has been [[parser|parsed]], often used as a [[compiler (computing)|compiler]] or [[interpreter (computing)|interpreter]]'s internal [[intermediate representation|representation]] of a [[computer program]] while it is being [[compiler optimization|optimized]] and from which code generation is performed. The range of all possible such structures is described by the [[abstract syntax]].

{{msg:stub}}

''This article is based on material from [[FOLDOC]], used with [[Public Domain Resources/Foldoc license|permission]]. Update as needed.''

==See also==

Line 13 ⟶ 10:

*[[Symbol table]]

*[[Document object model]]

==References==

{{FOLDOC}}

==External links==

*[http://citeseer.ist.psu.edu/cis?q=abstract+syntax+tree Citations from CiteSeer]

[[Category:Trees (structure)]]

{{msg:stub}}

[[Category:Formal languages]]