public static class Translet.OrLimesParser<A> extends Translet.LimesParser<A>
p1, p2, p3, p4| Constructor and Description |
|---|
OrLimesParser(Translet.Parser<? extends A> p1,
Translet.Parser<? extends A> p2,
Translet.Parser<? extends A> p3,
Translet.Parser<? extends A> p4)
Constructor called by factory methods.
|
| Modifier and Type | Method and Description |
|---|---|
Format |
name(boolean full,
Map<Translet.Recursive,String> names)
Returns a user-readable text representation.
|
Set<Translet.State<A>> |
parseOneState(Translet.State<?> inState,
Set<Translet.Alternative> alternatives)
Try to parse all sub-parsers by
Translet.disj_testOneBranch(Parser,Parser,List,int,State,Set,Set). |
unparse, wrapResultexecuteStoring, isTerminal, mparse, name, parseEpsilon, stripOpt, toString, toStringpublic OrLimesParser(Translet.Parser<? extends A> p1, Translet.Parser<? extends A> p2, Translet.Parser<? extends A> p3, Translet.Parser<? extends A> p4)
public Set<Translet.State<A>> parseOneState(Translet.State<?> inState, Set<Translet.Alternative> alternatives)
Translet.disj_testOneBranch(Parser,Parser,List,int,State,Set,Set).
If no single alternative is hit, simply null is returned and a new
Alternative is created one level above.
If some sub-parsers are not hit, one new Alternative is constructed,
joining them to a new disjunction.parseOneState in class Translet.Parser<A>public Format name(boolean full, Map<Translet.Recursive,String> names)
Translet.Parsername in class Translet.Parser<A>full - whether storage constructs do appear in the rendering.names - a map for managing the renderings of recursive calls