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`
InfixNode
​
InfixNode
[op,{children},meta]
is a flat n-ary operator chain: op is the operator descriptor string, children is the list of two or more operands, and meta is a metadata association.
​
Details and Options
▪
InfixNode
is inert data: it carries no
DownValues
, so building one just holds the three arguments. It mirrors
CodeParser
sown
CodeParser
`InfixNode
.
▪
The difference from
BinaryNode
is arity: an
InfixNode
flattens a whole same-operator run
a+b+c
into one node with three children, whereas a
BinaryNode
chain nests pairwise.
▪
op stays a language-native descriptor string (
"+"
) rather than a Wolfram symbol.
▪
InfixNode
is part of the standard vocabulary, but the five sample grammars do not flatten chains:
CalculatorAST
builds nested
BinaryNode
nodes for
1+2+3
instead of one
InfixNode
. The
"Infix"
builder of
ASTAlgebra
is present for grammars that prefer the flat form. The first example below builds the node literally.
▪
meta holds a
"Source"
position when the node comes from a real parse, and is an empty

when you build it by hand.
​
Examples  
(2)
Basic Examples  
(1)
An infix node built literally flattens the whole
1+2+3
run into one node with three children:
In[1]:=
InfixNode
"+",
LeafNode
["Integer","1",],
LeafNode
["Integer","2",],
LeafNode
["Integer","3",],
Out[1]=
InfixNode[+,{LeafNode[Integer,1,],LeafNode[Integer,2,],LeafNode[Integer,3,]},]
The calculator does not flatten: the same
1+2+3
parses to nested
BinaryNode
nodes, not an
InfixNode
:
In[2]:=
CalculatorAST
["1+2+3"]
Out[2]=
ContainerNode[String,{BinaryNode[+,{BinaryNode[+,{LeafNode[Integer,1,Source{{1,1},{1,2}}],LeafNode[Integer,2,Source{{1,3},{1,4}}]},Source{{1,1},{1,4}}],LeafNode[Integer,3,Source{{1,5},{1,6}}]},Source{{1,1},{1,6}}]},Source{{1,1},{1,6}}]
Properties & Relations  
(1)

SeeAlso
BinaryNode
 
▪
PrefixNode
 
▪
PostfixNode
 
▪
TernaryNode
 
▪
ASTNodeQ
 
▪
ToCodeParser
RelatedGuides
▪
ParserZoo
""

© 2026 Wolfram. All rights reserved.

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