Package eu.bandm.tools.ramus.runtime2

Class Choice<R,M,O>

java.lang.Object

eu.bandm.tools.ramus.runtime2.Action<R,M,O>

eu.bandm.tools.ramus.runtime2.Choice<R,M,O>

public final class Choice<R,M,O>
extends Action<R,M,O>

Choice node class of the parsing search-tree monad.

Nested Class Summary

Nested classes/interfaces inherited from class eu.bandm.tools.ramus.runtime2.Action

Action.BiContinuation<R,S,T,M,O>, Action.Continuation<R,S,M,O>, Action.Trampoline<R,S,M,O>, Action.Visitor<R,M,O>

Constructor Summary

Constructors

Constructor	Description
Choice()
Choice(Action<? extends R,M,O>... alts)
Choice(List<? extends Action<? extends R,M,O>> alts)

Method Summary

Modifier and Type	Method	Description
<S> Action<S,M,O>	bind(Action.Continuation<? super R,S,M,O> cont)	Applies a monadic continuation to all leaves of this search tree (transition operation).
static <R, M, O> Choice<R,M,O>	either(Action<R,M,O> first, Action<R,M,O> second)
List<Action<? extends R,M,O>>	getAlts()
protected int	getLeafCount()
void	host(Action.Visitor<? super R,M,O> v)	Performs a double dispatch to the appropriate method of a visitor.
boolean	isEmpty()	Checks whether this search tree is empty.
<Q> Action<? extends R,M,Q>	prune()	Simplifies this search tree by removing redundant choice nodes and all obstructions (transition operation).
protected <Q> boolean	pruneTo(List<? super Action<? extends R,M,Q>> alts)	Adds a pruned variant of this search subtree to a list of choice alternatives.
String	toString()

Methods inherited from class eu.bandm.tools.ramus.runtime2.Action

choice, diagnosis, diagnosis, fail, fail, findFirstResult, forEachObstruction, forEachResult, map, optional, optional, succeed, succeed

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Constructor Details

Choice

Choice()

Choice

@SafeVarargs
Choice(Action<? extends R,M,O>... alts)

Choice

Choice(List<? extends Action<? extends R,M,O>> alts)

Method Details

either

public static <R,
M,
O> Choice<R,M,O> either(Action<R,M,O> first,
 Action<R,M,O> second)

getAlts

public List<Action<? extends R,M,O>> getAlts()

getLeafCount

protected int getLeafCount()

Specified by:

getLeafCount in class Action<R,M,O>

bind

public <S> Action<S,M,O> bind(Action.Continuation<? super R,S,M,O> cont)

Description copied from class: Action

Applies a monadic continuation to all leaves of this search tree (transition operation).

Specified by:

bind in class Action<R,M,O>

Type Parameters:

S - the output parsing result type of the continuation

Parameters:

cont - the continuation to apply

Returns:

an updated search tree

prune

public <Q> Action<? extends R,M,Q> prune()

Description copied from class: Action

Simplifies this search tree by removing redundant choice nodes and all obstructions (transition operation).

Specified by:

prune in class Action<R,M,O>

Type Parameters:

Q - the new type of obstructions

Returns:

a simplified search tree without nested or unary choice nodes

pruneTo

protected <Q> boolean pruneTo(List<? super Action<? extends R,M,Q>> alts)

Description copied from class: Action

Adds a pruned variant of this search subtree to a list of choice alternatives.

Overrides:

pruneTo in class Action<R,M,O>

Type Parameters:

Q - the new type of obstructions

Parameters:

alts - the list to add to

Returns:

true iff this subtree has been simplified by recursive pruning

isEmpty

public boolean isEmpty()

Description copied from class: Action

Checks whether this search tree is empty.

Specified by:

isEmpty in class Action<R,M,O>

Returns:

true iff this tree has no leaves

toString

public String toString()

Overrides:

toString in class Object

host

public void host(Action.Visitor<? super R,M,O> v)

Description copied from class: Action

Performs a double dispatch to the appropriate method of a visitor.

Specified by:

host in class Action<R,M,O>

Parameters:

v - the visitor