Wolfram Language Paclet Repository

Community-contributed installable additions to the Wolfram Language

Primary Navigation

    • Cloud & Deployment
    • Core Language & Structure
    • Data Manipulation & Analysis
    • Engineering Data & Computation
    • External Interfaces & Connections
    • Financial Data & Computation
    • Geographic Data & Computation
    • Geometry
    • Graphs & Networks
    • Higher Mathematical Computation
    • Images
    • Knowledge Representation & Natural Language
    • Machine Learning
    • Notebook Documents & Presentation
    • Scientific and Medical Data & Computation
    • Social, Cultural & Linguistic Data
    • Strings & Text
    • Symbolic & Numeric Computation
    • System Operation & Setup
    • Time-Related Computation
    • User Interface Construction
    • Visualization & Graphics
    • Random Paclet
    • Alphabetical List
  • Using Paclets
    • Get Started
    • Download Definition Notebook
  • Learn More about Wolfram Language

Parser

Tutorials

  • Building Language Front-Ends
  • Inside CodeAnalysis - How CodeStructure Parses C
  • Design and Compilation Strategy
  • Implementing the LaTeX Math Parser
  • MaTeX Comparison Showcase
  • The Parser Landscape - a Survey of What Exists Today
  • The Parser Zoo - language front-ends over a shared algebra
  • Parsing BNF Grammars (and bootstrapping a TPTP parser)
  • Parsing GrammarRules Locally
  • A Markdown Inline Parser in Parser Combinators
  • ParsingOpenQASM
  • Parsing TPTP, Auto-Generated from the Published BNF
  • PrattVsPEG
  • The Wolfram Box Typesetting Reference

Guides

  • Parsing in the Wolfram Language

Symbols

  • ASTAddSource
  • ASTAlgebra
  • ASTContainer
  • ASTLeafQ
  • ASTNodeQ
  • ASTStripSource
  • BinaryNode
  • BrainfuckAST
  • BrainfuckGrammar
  • BrainfuckRun
  • BrainfuckSemantic
  • CalculatorAST
  • CalculatorEval
  • CalculatorGrammar
  • CalculatorSemantic
  • CallNode
  • ContainerNode
  • EBNFParse
  • EBNFRules
  • ErrorNode
  • ExportLaTeX
  • GroupNode
  • InfixNode
  • JSONAST
  • JSONGrammar
  • JSONImport
  • JSONSemantic
  • LambdaAST
  • LambdaEval
  • LambdaGrammar
  • LambdaSemantic
  • LaTeXMathParse
  • LaTeXMathParser
  • LaTeXMathStyle
  • LeafNode
  • LispAST
  • LispGrammar
  • LispRead
  • LispSemantic
  • LispSymbol
  • MarkdownInlineParse
  • MarkdownInlineParser
  • MarkdownParse
  • MarkdownParser
  • ParseAction
  • ParseBetween
  • ParseChainLeft
  • ParseChainRight
  • ParseCharacter
  • ParseChoiceLongest
  • ParseChoice
  • ParseFail
  • ParseLiteral
  • ParseLookahead
  • ParseMany
  • Parse
  • ParseNotFollowedBy
  • ParseOperatorTable
  • ParseOptional
  • ParsePartial
  • ParsePosition
  • ParserCombinator
  • ParserCombinatorQ
  • ParserCompile
  • ParseRecursive
  • ParseRegex
  • ParseSepBy1
  • ParseSepBy
  • ParseSequence
  • ParseSome
  • ParseSucceed
  • ParseTry
  • PostfixNode
  • PrefixNode
  • RecCell
  • RecRef
  • SetRec
  • SpannedToken
  • TernaryNode
  • ToCodeParser
  • TPTPExport
  • TPTPImport

Overviews

  • WolframParser
Wolfram`Parser`
CallNode
​
CallNode
[head,args,meta]
is an application node of the standard syntax tree: head is itself a node (usually a
LeafNode
), args is the list of argument nodes, and meta is a metadata association.
​
Details and Options
▪
CallNode
is inert data: it carries no
DownValues
, so building one just holds the three arguments. It mirrors
CodeParser
sown
CodeParser
`CallNode
, differing only in that head may stay a language-native leaf rather than a Wolfram symbol.
▪
Unlike the operator nodes, the head of a
CallNode
is a full node, not an operator descriptor string. This makes it the right shape for prefix-application languages where the operator position holds an arbitrary expression.
▪
args is always a list, even for a single argument.
▪
LispAST
turns a non-empty list
(fab)
into a
CallNode
headed by its first element;
LambdaAST
uses it both for application (juxtaposition
fx
) and for abstraction, where the head is the lambda leaf
LeafNode["Symbol","λ",]
and the two children are the bound name and the body.
▪
The calculator and JSON grammars build operator nodes (
BinaryNode
,
PrefixNode
,
GroupNode
) instead of
CallNode
. meta holds a
"Source"
position when the call comes from a real parse, and is an empty

when you build the node by hand.
​
Examples  
(2)
Basic Examples  
(1)
A call built literally holds its head and argument list:
In[1]:=
CallNode

LeafNode
["Symbol","f",],
LeafNode
["Symbol","x",],
Out[1]=
CallNode[LeafNode[Symbol,f,],{LeafNode[Symbol,x,]},]
A Lisp s-expression reads head-first into a
CallNode
:
In[2]:=
LispAST
["(f x)"]
Out[2]=
ContainerNode[String,{CallNode[LeafNode[Symbol,f,Source{{1,2},{1,3}}],{LeafNode[Symbol,x,Source{{1,4},{1,5}}]},Source{{1,2},{1,5}}]},Source{{1,2},{1,5}}]
Lambda-calculus application juxtaposes the two terms into a
CallNode
:
In[3]:=
LambdaAST
["f x"]
Out[3]=
ContainerNode[String,{CallNode[LeafNode[Symbol,f,Source{{1,1},{1,2}}],{LeafNode[Symbol,x,Source{{1,3},{1,4}}]},Source{{1,1},{1,4}}]},Source{{1,1},{1,4}}]
Properties & Relations  
(1)

SeeAlso
LeafNode
 
▪
GroupNode
 
▪
ContainerNode
 
▪
ASTNodeQ
 
▪
ToCodeParser
 
▪
ASTAlgebra
RelatedGuides
▪
Parser Zoo
""

© 2026 Wolfram. All rights reserved.

  • Legal & Privacy Policy
  • Contact Us
  • WolframAlpha.com
  • WolframCloud.com