Abstract syntax tree
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
Explore this link on the map →related reading
- 2. Kaleidoscope: Implementing a Parser and AST — LLVM 23.0.0git documentationllvm.org
- Representing Code · Crafting Interpreterscraftinginterpreters.com
- how I think when I think about programming - alice mazalicemaz.com
- Reading 12: Regular Expressions & Grammarsweb.mit.edu
- Tree (abstract data type) - Wikipediaen.wikipedia.org
- Adrian Sampson: Flattening ASTs (and Other Compiler Data Structures)cs.cornell.edu
- Reading 19: Parsersweb.mit.edu
- Reading 19: Little Languagesweb.mit.edu
- A Map of the Territory · Crafting Interpreterscraftinginterpreters.com
- A Map of the Territory · Crafting Interpreterscraftinginterpreters.com
- Shunting yard algorithm - Wikipediaen.wikipedia.org
- Formally speaking, "Transpiler" is a useless word | Rachit Nigampeople.csail.mit.edu