| Package | Description |
|---|---|
| eu.bandm.tscore.base |
Generic and low level data types and transformation algorithms,
to be used by very different applications of the
tscore
framework. |
| Modifier and Type | Method and Description |
|---|---|
protected static void |
Translet.disj_makeAlternative(Translet.disj_flavour flavour,
Translet.State<?> inState,
Set<Translet.Alternative> alternatives,
List<Translet.Parser<?>> notHit,
Set<Translet.Alternative> subAlts)
Constructs a new disjunction parser of the given kind with all failed
sub-parser, to add this new expression to alternatives.
|
protected static void |
Translet.disj_makeAlternative(Translet.disj_flavour flavour,
Translet.State<?> inState,
Set<Translet.Alternative> alternatives,
List<Translet.Parser<?>> notHit,
Set<Translet.Alternative> subAlts)
Constructs a new disjunction parser of the given kind with all failed
sub-parser, to add this new expression to alternatives.
|
protected static <R,S> void |
Translet.disj_testOneBranch(Translet.Parser<S> disj_parser,
Translet.Parser<R> parser,
List<Translet.Parser<?>> notHit,
int index,
Translet.State<?> inState,
Set<Translet.State<S>> outStates,
Set<Translet.Alternative> alternatives)
Tests one of the branch-parsers (with the given index) of the disj_parser,
with the given start state.
|
static <R> void |
Translet.displayBindings(CatalogByString cat,
List<String> prefs,
PrintWriter pw,
int width,
boolean full,
@Opt Object locationtext,
Translet.Parser<?> parser,
@Opt Set<Translet.State<R>> results,
@Opt Translet.State<R> selected,
Set<Translet.State<R>> rests,
Set<Translet.Alternative> alts,
Modifiers modifiers,
boolean showAlts,
boolean showRests)
Show complete parsing situation on a PrintStream, possibly multi-lingual.
|
Set<Translet.State<R>> |
Translet.Parser.mparse(Set<? extends Translet.State<?>> inStates,
Set<Translet.Alternative> alternatives)
"*M*ultiple Parse" means to apply the parser to a set of incoming
Translet.States, which represent the parsing situations reached so far. |
Set<Translet.State<R>> |
TransletLib._TEST.parseOneState(Translet.State<?> inState,
Set<Translet.Alternative> alternatives) |
protected abstract Set<Translet.State<R>> |
Translet.Parser.parseOneState(Translet.State<?> inState,
Set<Translet.Alternative> alternatives)
Calculate a set of possible successor states by applying this parser
to the incoming state and append all altenatives found underways to
the parameter "alternatives".
|
Set<Translet.State<R>> |
Translet.Recursive.parseOneState(Translet.State<?> inState,
Set<Translet.Alternative> alternatives) |
protected Set<Translet.State<R>> |
Translet._CONST.parseOneState(Translet.State<?> st,
Set<Translet.Alternative> alternatives) |
protected Set<Translet.State<String>> |
Translet._REGEX.parseOneState(Translet.State<?> st,
Set<Translet.Alternative> alternatives) |
protected Set<Translet.State<R>> |
Translet._CAT.parseOneState(Translet.State<?> st,
Set<Translet.Alternative> alternatives)
Return the longest possible match of catalog entries.
|
Set<Translet.State<S>> |
Translet.StorageWrapper.parseOneState(Translet.State<?> inState,
Set<Translet.Alternative> alternatives)
Simply memorizes this parser by inserting a new state after the
states resulting from the sub-parser.
|
Set<Translet.State<A>> |
Translet.FramedParser.parseOneState(Translet.State<?> inState,
Set<Translet.Alternative> alternatives) |
Set<Translet.State<A>> |
Translet.HeadParser.parseOneState(Translet.State<?> inState,
Set<Translet.Alternative> alternatives) |
Set<Translet.State<R>> |
Translet.SequParser.parseOneState(Translet.State<?> inState,
Set<Translet.Alternative> alternatives)
Parse breadth-first the list of sub-parsers and memorize all
resulting states for later result retrieval.
|
Set<Translet.State<R>> |
Translet.PermutationParser.parseOneState(Translet.State<?> inState,
Set<Translet.Alternative> alternatives) |
Set<Translet.State<CoTuple<A,B,C,D>>> |
Translet.OrCoTupleParser.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). |
Set<Translet.State<CoTuple<A,B,C,D>>> |
Translet.PriorCoTupleParser.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). |
Set<Translet.State<A>> |
Translet.OrLimesParser.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). |
Set<Translet.State<A>> |
Translet.PriorLimesParser.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). |
Set<Translet.State<List<D>>> |
Translet.RepParser.parseOneState(Translet.State<?> inState,
Set<Translet.Alternative> alternatives)
Calculate a set of possible successor states by applying this parser
to the incoming state and append all altenatives found underways to
the parameter "alternatives".
|
Set<Translet.State<D>> |
Translet.OptionParser.parseOneState(Translet.State<?> inState,
Set<Translet.Alternative> alternatives) |
protected void |
Translet.RepParser.parseProlongation(List<D> prefix,
Translet.State<?> inState,
Set<Translet.Alternative> alternatives,
Set<Translet.State<List<D>>> allResults)
Basic parser procedure for all four kinds of RepParsers.
|
protected static boolean |
Translet.significantAltsExist(int index,
Set<Translet.Alternative> alts)
Find whether an alternative exists which started AFTER having consumed
some input > epsilon.
|
protected Set<? extends Translet.State<?>> |
Translet.PermutationParser.test2(Translet.State<?> oneState,
BitSet tested,
BitSet toEpsilon,
Set<Translet.Alternative> alternatives)
Tests all permutations by breadth first search: first testing all sub-parsers
once, and then calling this function recursively for all states resulting
from these calls.
|