Content deleted Content added
See also... |
No edit summary |
||
Line 1:
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]].
Sometimes the code behind an abstract syntax trees (classes, for example), are generated by a parser generator, but many language engineers prefer to design and implement the tree themselves, as it expresses the fundamental structure of the language.
{{stub}}
|