Dart
AST
Learn the Abstract Syntax Tree (AST) structure.
AST
AST (Abstract Syntax Tree) is the tree-shaped representation of source code. Each node represents an expression, statement, or declaration. For example, a + b is modeled as a BinaryOp('+', a, b) node.
Being abstract, the AST omits irrelevant details (whitespace, comments). The parser produces an AST from the token stream; type checking, optimization and Kernel conversion run on this tree. The AST is the first stage where the compiler represents code semantically.
AST node types
The AST contains different node types: Literal (constant values), Identifier (variable references), BinaryOp (two-operand operation), FunctionCall (a call). Each node may have child nodes.
For example, add(1, 2) is modeled as FunctionCall('add', [Literal(1), Literal(2)]). Type checking runs on the AST; each node gets a static type. This is the basis of compile-time errors.
Exercise An AST Node class
Define a Node class with final String name; final List<Node> children; Node(this.name, this.children); field and constructor. Add an int count() => 1 + children.length; method. In main create final n = Node('BinaryOp', [Node('a', []), Node('b', [])]);; print with print(n.count());.
Show example solution
class Node {
final String name;
final List<Node> children;
Node(this.name, this.children);
int count() => 1 + children.length;
}
void main() {
final n = Node('BinaryOp', [Node('a', []), Node('b', [])]);
print(n.count());
}
Test yourself
-
An AST node
final node = Node('____', [Node('a', []), Node('b', [])]);
print(node.name);
Show answer
final node = Node('BinaryOp', [Node('a', []), Node('b', [])]);
print(node.name);
-
What is the purpose of the AST?
- To represent source semantically
- To write code
- To collect garbage
- To download packages
Show answer
To represent source semantically — the AST is the semantic tree representation of source code.
-
Match the AST nodes
- Literal
- Constant value
- Identifier
- Variable reference
- BinaryOp
- Two-operand operation
- FunctionCall
- Call
Next lesson: Kernel
