Wolfram Language Paclet Repository
Community-contributed installable additions to the Wolfram Language
Wolfram`Parser`
Parse  |
|
| | ||||
▪
Parse
▪
A declaration is lowered to a (and JIT-compiled the first time it is seen) before being run; the lowering result is cached so a second call against the same grammar reuses the work.
GrammarRules
ParserCombinator
Parse[grammar,...]
▪
For a without a entry in its options, runs the interpretive path. For a parser already passed through , invokes the compiled function directly. Either way, and are equivalent ( carries a SubValue rule that routes one to the other).
ParserCombinator
"Code"
Parse
Parse
parser[input]
Parse[parser,input]
▪
On success the return value is the structured result the combinator built - usually a string, a list of children, or an action's return value.
▪
On failure the return value is a association carrying the position of the furthest-advanced failure, the set of expected tokens at that position, and what was found instead.
Failure["ParseError","Position"_,"Expected"_,"Found"_,...]
Examples
(5)
Basic Examples
(1)
A literal parser matches when the input is exactly the literal:
In[1]:=
 | Parse |
 | ParseLiteral |
Out[1]=
foo
A digit parser:
In[2]:=
| Parse |
| ParseCharacter |
Out[2]=
5
A sequence built with the operator:
~~
In[3]:=
| Parse |
 | ParseLiteral |
| ParseLiteral |
Out[3]=
{foo,bar}
The same via the SubValue ( is ):
parser[input]
Parse[parser,input]
In[4]:=
["foo"]~~
["bar"]["foobar"]
| ParseLiteral |
| ParseLiteral |
Out[4]=
{foo,bar}
Scope
(1)
Properties & Relations
(1)
Possible Issues
(1)
Neat Examples
(1)
 |
|
 |
|
""