Wolfram Language Paclet Repository
Community-contributed installable additions to the Wolfram Language
Wolfram`Parser`
ASTAlgebra  |
| is the of builder functions that emit the standard AST nodes. A grammar written over an algebra - an its semantic actions call - produces a standard syntax tree when handed ASTAlgebra | |
▪
An algebra is the indirection at the heart of the parser zoo: a grammar builder takes an algebra alg and its actions call , , and so on, never naming a node head directly. Feed the grammar and it builds a standard tree; feed it the language's own semantic algebra and the same grammar yields a meaningful value. The grammar is untouched; only the algebra is swapped.
alg["Binary"][op,l,r]
alg["Leaf"][kind,src]
ASTAlgebra
▪
The keys are the node constructors: , , , , , , , , . Each maps to a function that returns the matching node with empty metadata.
"Leaf"
"Prefix"
"Postfix"
"Binary"
"Infix"
"Ternary"
"Call"
"Group"
"Container"
▪
The standard nodes mirror Wolfram's own shape - a 3-slot triple - but operator descriptors stay language-native strings (, , ) rather than being forced into Wolfram symbols. projects a neutral tree onto -exact nodes when that is wanted.
CodeParser
Head[descriptor,children,meta]
"+"
":"
"'"
CodeParser
▪
Extend it for language-specific constructs that map onto a standard node: .
ASTAlgebra,"Object"(GroupNode["Object",#,]&)
▪
ASTAlgebra
Source
{{line,col},{line,col}}
Source
Examples
(3)
Basic Examples
(1)
In[1]:=
 | ASTAlgebra |
 | LeafNode |
| LeafNode |
Out[1]=
BinaryNode[+,{LeafNode[Integer,1,],LeafNode[Integer,2,]},]
The builder makes a terminal from a kind descriptor and the matched source text:
"Leaf"
In[2]:=
| ASTAlgebra |
Out[2]=
LeafNode[Integer,42,]
The nine builder keys:
In[3]:=
Keys
 | ASTAlgebra |
Out[3]=
{Leaf,Prefix,Postfix,Binary,Infix,Ternary,Call,Group,Container}
Scope
(1)
Properties & Relations
(1)
 |
|
 |
|
""