In [[computer science]], '''Abstractabstract 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]].
''This article is based on material from [[FOLDOC]], used with [[Public Domain Resources/Foldoc license|permission]]. Update as needed.'' {{msg:stub}}
