Wolfram/Parser | Paclet Repository

Wolfram`Parser`

ToCodeParser

ToCodeParser [tree]
	best-effort projects a neutral node tree onto CodeParser -exact nodes.

ToCodeParser [tree,opmap]
	additionally maps each operator descriptor to a Wolfram symbol through the Association opmap.

Details and Options

▪

The standard AST nodes share

CodeParser

's 3-slot shape but keep operator descriptors as language-native strings (

"+"

, not

Plus

ToCodeParser

rewrites a tree into the

CodeParser

-namespaced heads so it can flow into tools that expect real

CodeParser

output.

▪

The operator-bearing nodes (

) all become a

CodeParser

CallNode` headed by a symbol leaf; the descriptor is looked up in opmap, defaulting to the descriptor string itself when absent.

▪

LeafNode

kind string is mapped to a Wolfram symbol where there is an obvious one:

"Integer"Integer

"Real"Real

"String"String

"Symbol"Symbol

"Rational"Rational

; any other kind becomes

Symbol

▪

GroupNode

becomes a

CallNode

headed by a symbol leaf carrying the group kind; a

ContainerNode

becomes a

CodeParser

ContainerNode`; a

CallNode

keeps its head and arguments.

▪

It is best-effort: the projection is structural, so an unmapped operator stays a string leaf. Metadata is carried through untouched - when the input tree already has

Source{{line,col},{line,col}}

(as a

tree does, via

and

), the projected

CodeParser

-nodes keep it; a literally-built node with



projects to



Examples

(3)

Basic Examples

(1)

A neutral

CalculatorAST

tree projects onto

CodeParser

's shape; the opmap turns

"+"

into a real

Plus

, and the

Source

spans the grammar stamped on each node carry through:

In[1]:=

ToCodeParser



CalculatorAST

["1+2"],"+"Plus

Out[1]=

CodeParser`ContainerNode[String,{CodeParser`CallNode[CodeParser`LeafNode[Symbol,Plus,],{CodeParser`LeafNode[Integer,1,Source{{1,1},{1,2}}],CodeParser`LeafNode[Integer,2,Source{{1,3},{1,4}}]},Source{{1,1},{1,4}}]},Source{{1,1},{1,4}}]