Uses of Class
eu.bandm.tools.lexic.Behavior
-
Uses of Behavior in eu.bandm.tools.lexic
Modifier and TypeClassDescriptionclass
ZAutomaton<V>
Zero-overhead automaton that is identical to the behavior of its own initial state.Modifier and TypeFieldDescriptionprotected final Map<Automaton.State,
Behavior<L, T>> Automaton.table
The behavioral table of the automaton.Modifier and TypeMethodDescriptionstatic <L,
T> Behavior<L, T> Behavior.constant
(L label, T transition) Returns a behavior that recognizes all input code points.static <L,
T> Behavior<L, T> Behavior.consume
(L label, int codePoint, T transition) Returns a behavior that recognizes only a particular input code point.static <L,
T> Behavior<L, T> Behavior.consumeAnyOf
(L label, int[] codePoints, T transition) Returns a behavior that recognizes only some particular input code points.static <L,
T> Behavior<L, T> Behavior.consumeExcept
(L label, int[] codePoints, T transition) Returns a behavior that recognizes all except some particular input code points.static <L,
T, U, V> Behavior<L, V> Behavior.intersect
(Behavior<L, T> one, Behavior<L, U> other, BinaryOperator<L> intersectLabels, BiFunction<T, U, V> intersectTransitions) Returns a behavior that intersects both transitions and labels of two behaviors.<M,
U> Behavior<M, U> Returns a behavior that differs from this behavior by having applied the given functions to the label and all transitions, respectively.Behavior.mapTransitions
(Function<? super T, ? extends U> onTransition) Returns a behavior that differs from this behavior by having applied the given function to all transitions.static <L,
T> Behavior<L, T> Behavior.merge
(Behavior<L, T> one, Behavior<L, T> other, BinaryOperator<L> mergeLabels, BinaryOperator<T> mergeTransitions) Returns a behavior that merges both labels and transitions of two behaviors.static <L,
T> Behavior<L, T> Behavior.of
(L label) Returns a behavior that recognizes no input code points.Behavior.simplify()
Returns a behavior that differs from this behavior at most by simplification of the transition map.Returns a behavior that differs from this behavior by recognizing all previously unrecognized code points.Modifier and TypeMethodDescriptionstatic <L,
T, U, V> Behavior<L, V> Behavior.intersect
(Behavior<L, T> one, Behavior<L, U> other, BinaryOperator<L> intersectLabels, BiFunction<T, U, V> intersectTransitions) Returns a behavior that intersects both transitions and labels of two behaviors.protected abstract B
Automaton.Transformer.makeBehavior
(Automaton.State oldState, Behavior<L, T> oldBehavior) Returns the behavior that the given behavior is transformed into.static <L,
T> Behavior<L, T> Behavior.merge
(Behavior<L, T> one, Behavior<L, T> other, BinaryOperator<L> mergeLabels, BinaryOperator<T> mergeTransitions) Returns a behavior that merges both labels and transitions of two behaviors.(package private) static <V> ZAutomaton<V>
Creates a prototype automaton from a symbolic behavior.Modifier and TypeMethodDescription(package private) void
Changes the transitions of this automaton according to a given substitution.ModifierConstructorDescriptionprotected
Automaton
(Automaton.State initial, Map<Automaton.State, Behavior<L, T>> table) Creates a new instance.(package private)
DAutomaton
(Automaton.State initial, Map<Automaton.State, Behavior<List<V>, Automaton.State>> table) Creates a new instance.(package private)
NAutomaton
(Automaton.State initial, Map<Automaton.State, Behavior<Set<V>, Set<Automaton.State>>> table) Creates a new instance.