public static class Translet.PriorCoTupleParser<A,B,C,D> extends Translet.CoTupleParser<A,B,C,D>
p1, p2, p3, p4
Constructor and Description |
---|
PriorCoTupleParser(Translet.Parser<A> p1,
Translet.Parser<B> p2,
Translet.Parser<C> p3,
Translet.Parser<D> 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<CoTuple<A,B,C,D>>> |
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) . |
String |
unparse(Object key)
Reverse the parsing process (as far as possible) and deliver a
string representation which when parsed delivered the parse result.
|
wrapResult
executeStoring, isTerminal, mparse, name, parseEpsilon, stripOpt, toString, toString
public PriorCoTupleParser(Translet.Parser<A> p1, Translet.Parser<B> p2, Translet.Parser<C> p3, Translet.Parser<D> p4)
public String unparse(Object key)
Translet.Parser
public Set<Translet.State<CoTuple<A,B,C,D>>> 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<CoTuple<A,B,C,D>>
public Format name(boolean full, Map<Translet.Recursive,String> names)
Translet.Parser