Uses of Class
eu.bandm.tscore.base.Translet.Alternative
Package
Description
Generic and low level data types and transformation algorithms,
to be used by very different applications of the
tscore
framework.-
Uses of Translet.Alternative in eu.bandm.tscore.base
Modifier and TypeMethodDescriptionprotected 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 Set<Translet.State<R>>
Translet._CAT.parseOneState
(Translet.State<?> st, Set<Translet.Alternative> alternatives) Return the longest possible match of catalog entries.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) Translet.FramedParser.parseOneState
(Translet.State<?> inState, Set<Translet.Alternative> alternatives) Translet.HeadParser.parseOneState
(Translet.State<?> inState, Set<Translet.Alternative> alternatives) Translet.OptionParser.parseOneState
(Translet.State<?> inState, Set<Translet.Alternative> alternatives) Translet.OrCoTupleParser.parseOneState
(Translet.State<?> inState, Set<Translet.Alternative> alternatives) Try to parse all sub-parsers byTranslet.disj_testOneBranch(DisjunctionParser,Parser,List,int,State,Set,Set)
.Translet.OrLimesParser.parseOneState
(Translet.State<?> inState, Set<Translet.Alternative> alternatives) Try to parse all sub-parsers byTranslet.disj_testOneBranch(DisjunctionParser,Parser,List,int,State,Set,Set)
.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".Translet.PermutationParser.parseOneState
(Translet.State<?> inState, Set<Translet.Alternative> alternatives) Translet.PriorCoTupleParser.parseOneState
(Translet.State<?> inState, Set<Translet.Alternative> alternatives) Try to parse all sub-parsers byTranslet.disj_testOneBranch(DisjunctionParser,Parser,List,int,State,Set,Set)
.Translet.PriorLimesParser.parseOneState
(Translet.State<?> inState, Set<Translet.Alternative> alternatives) Try to parse all sub-parsers byTranslet.disj_testOneBranch(DisjunctionParser,Parser,List,int,State,Set,Set)
.Translet.Recursive.parseOneState
(Translet.State<?> inState, Set<Translet.Alternative> alternatives) 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".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.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.TransletLib._TEST.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.