Wolfram Language Paclet Repository
Community-contributed installable additions to the Wolfram Language
Wolfram`Parser`
ParseChoiceLongest  |
|
| | ||||
▪
Where is PEG-ordered — it stops at the first alternative that matches — is POSIX-style: it runs every alternative and commits to the one that consumed the most input.
▪
Ties between equal-length successes resolve to the first listed alternative, mirroring 's left-bias.
▪
It cannot early-exit at the first hit, so it always runs all branches; it is slower than by that constant factor.
▪
The case it exists for: alternatives that share a leaf-level prefix and differ only in what follows, so the shorter alternative is a prefix of the correct one. Ordering longest-first cannot fix this when the alternatives are factored across separate rules — TPTP's , where both branches consume the same leading term but only the second reaches a trailing .
<fof_atomic_formula>::=<fof_plain_atomic_formula>|<fof_defined_atomic_formula>
=rhs
▪
There is no operator overload: lowers to (via ), never to . Call explicitly.
p1|p2
▪
▪
▪
On total failure the reported error is the furthest-advanced failure across all branches, and its set is the union of the per-branch expected sets at that position — the same diagnostic produces.
Expected
▪
Result type: whatever the winning branch returned.
▪
It is the combinator folds a rule's alternatives with under and, for length-ambiguous rules, .
"ChoiceMode""Longest"
"ChoiceMode""Auto"
Examples
(13)
Basic Examples
(3)
Two alternatives share the prefix ; longest-match takes the branch that consumes the whole input:
ab
In[1]:=
 | Parse |
 | ParseChoiceLongest |
 | ParseLiteral |
| ParseLiteral |
Out[1]=
abc
_________________________________________________________________________________________________________________
The same two alternatives under pick the shorter branch first, leaving unconsumed and failing the whole-input match:
c
In[1]:=
| Parse |
| ParseChoice |
| ParseLiteral |
| ParseLiteral |
Out[1]=
Failure
 | |
|
_________________________________________________________________________________________________________________
Longest-match is independent of the order the alternatives are listed — the longer branch wins even when it comes first:
In[1]:=
| Parse |
| ParseChoiceLongest |
| ParseLiteral |
| ParseLiteral |
Out[1]=
abc
Scope
(3)
Properties & Relations
(5)
Possible Issues
(2)
 |
|
 |
|
""