Uses of Class
eu.bandm.tools.ramus.runtime2.Action
-
Uses of Action in eu.bandm.tools.ramus.runtime2
Modifier and TypeClassDescriptionclass
Blockage<R,
M, O> final class
Choice<R,
M, O> Choice node class of the parsing search-tree monad.class
Diagnosis<R,
M, O> final class
Success<R,
M, O> Leaf node class of the parsing search-tree monad.(package private) class
Thunk<R,
S, M, O> Modifier and TypeMethodDescription(package private) static <D,
T> Action<Parser.Output<D, T>, SimpleMessage<D>, Parser.Input<D, T>> Parser.append
(Action<Parser.Output<D, T>, SimpleMessage<D>, Parser.Input<D, T>> first, Update<SimpleMessage<D>> last) Applies this continuation, possibly using a recyclable leaf node.Applies this continuation, ignoring any recyclable leaf node.Applies this continuation, possibly using a recyclable leaf node.abstract Action<Parser.Output<D,
T>, SimpleMessage<D>, Parser.Input<D, T>> Parser.apply
(Parser.Input<D, T> in, Success<?, SimpleMessage<D>, Parser.Input<D, T>> recyclable) Applies this continuation, possibly using a recyclable leaf node.Parser.Proxy.apply
(Parser.Input<D, T> in, Success<?, SimpleMessage<D>, Parser.Input<D, T>> recyclable) Action.bind
(Action.Continuation<? super R, S, M, O> cont) Applies a monadic continuation to all leaves of this search tree (transition operation).Blockage.bind
(Action.Continuation<? super R, S, M, O> cont) Choice.bind
(Action.Continuation<? super R, S, M, O> cont) Diagnosis.bind
(Action.Continuation<? super R, S, M, O> cont) Success.bind
(Action.Continuation<? super R, S, M, O> cont) Applies a monadic continuation to all leaves of this search tree (transition operation).Thunk.bind
(Action.Continuation<? super S, T, M, O> cont) static <R,
M, O> Action<R, M, O> Creates a search tree from a choice of alternative subtreesstatic <D,
T> Action<Parser.Output<D, T>, SimpleMessage<D>, Parser.Input<D, T>> Parser.diagnoseUnexpectedToken
(Action<Parser.Output<D, T>, SimpleMessage<D>, Parser.Input<D, T>> body, Location<D> location, @Opt String description) static <R,
M, O> Action<R, M, O> Creates a search tree with diagnostic message attached to the root.static <R,
M, O> Action<R, M, O> Creates a search tree with diagnostic message attached to the root.static <R,
M, O> Action<R, M, O> Action.fail()
Creates a search tree with no alternatives.static <R,
M, O> Action<R, M, O> Action.fail
(O obstruction) Creates a search tree with no alternatives but an obstruction.Thunk.force()
Diagnosis.getBody()
Applies a function to all leaves of this search tree (transition operation).static <R,
M, O> Action<R, M, O> static <R,
S, M, O> Action<R, M, O> Parser.process
(Parser.Input<D, T> in, Action.Visitor<Parser.Output<D, T>, SimpleMessage<D>, Parser.Input<D, T>> errorVisitor) Action.prune()
Simplifies this search tree by removing redundant choice nodes and all obstructions (transition operation).Blockage.prune()
Choice.prune()
Diagnosis.prune()
Success.prune()
Thunk.prune()
Blockage.recycle()
Success.recycle
(S arg) static <R,
M, O> Action<R, M, O> Action.succeed
(R result) Creates a search tree with a single leaf.static <R,
M, O> Action<R, M, O> Creates a search tree with a single leaf, possibly using a recyclable leaf node.(package private) static Action<Parser.Output<Void,
Parser.Test.TokenType>, SimpleMessage<Void>, Parser.Input<Void, Parser.Test.TokenType>> Parser.Test.test
(Parser<Void, Parser.Test.TokenType> parser, Parser.Test.TokenType... input) Modifier and TypeMethodDescription(package private) static <D,
T> Action<Parser.Output<D, T>, SimpleMessage<D>, Parser.Input<D, T>> Parser.append
(Action<Parser.Output<D, T>, SimpleMessage<D>, Parser.Input<D, T>> first, Update<SimpleMessage<D>> last) static <R,
M, O> Action<R, M, O> Creates a search tree from a choice of alternative subtreesstatic <D,
T> Action<Parser.Output<D, T>, SimpleMessage<D>, Parser.Input<D, T>> Parser.diagnoseUnexpectedToken
(Action<Parser.Output<D, T>, SimpleMessage<D>, Parser.Input<D, T>> body, Location<D> location, @Opt String description) static <R,
M, O> Action<R, M, O> Creates a search tree with diagnostic message attached to the root.static <R,
M, O> Action<R, M, O> Creates a search tree with diagnostic message attached to the root.static <R,
M, O> Choice<R, M, O> Modifier and TypeMethodDescriptionstatic <R,
S, T, M, O>
Action.BiContinuation<R,S, T, M, O> Action.BiContinuation.forget
(BiFunction<? super R, ? super S, ? extends Action<T, M, O>> fun) Lifts a monadic function on parsing results to a continuation.static <R,
S, M, O> Action.Continuation<R, S, M, O> Lifts a monadic function on parsing results to a continuation.(package private) static <D,
T> Parser<D, T> Parser.lift
(Function<? super Parser.Input<D, T>, ? extends Action<Parser.Output<D, T>, SimpleMessage<D>, Parser.Input<D, T>>> fun) protected <Q> boolean
Adds a pruned variant of this search subtree to a list of choice alternatives.protected <Q> boolean
ModifierConstructorDescription(package private)
(package private)