Wolfram Language Paclet Repository
Community-contributed installable additions to the Wolfram Language
Wolfram`Parser`
ParserCompile  |
|
| | ||||
|
| | ||||
|
| | ||||
▪
Two backends. (default) lowers the combinator tree to a single 'd function - fast for small/medium grammars; recursive grammars need and otherwise stay interpretive. lowers the grammar to a flat integer instruction table interpreted by one native parsing machine (compiled once, shared by every grammar). Because the grammar is data, not code, the PEG-VM "compiles" any grammar of any size in milliseconds-to-seconds of plain Wolfram Language - no per-grammar - and handles arbitrary recursion via an explicit stack. Captures recorded during the native run are replayed by a Wolfram post-pass to rebuild the exact result (same actions as ).
MethodAutomatic
"Recursive"True
Method"PEGVM"
▪
ParserCompile
▪
The result is a of the same head as the input, with the compiled function folded into the options as . No separate flag - the presence of is the marker.
ParserCombinator
"Code"CompiledCodeFunction[...]
"Compiled"True
"Code"
▪
A compiled is callable as a function via the rule the wrapper carries: equals . Both end up invoking the cached compiled function rather than the interpreter.
ParserCombinator
compiled[input]
Parse[compiled,input]
▪
The compile cost is paid once per grammar; reuse the returned object across many calls.
[input]
Examples
(6)
Basic Examples
(1)
Compile a literal parser:
In[1]:=
 | ParserCompile |
 | ParseLiteral |
Out[1]=
ParserCombinator
 |
|
The compiled object is callable directly via its SubValue:
In[2]:=
parser=
["foo"];parser["foo"]
 | ParserCompile |
 | ParseLiteral |
Out[2]=
foo
Scope
(1)
Properties & Relations
(1)
Possible Issues
(2)
Neat Examples
(1)
 |
|
 |
|
""