Package eu.bandm.tools.ramus.runtime2
package eu.bandm.tools.ramus.runtime2
-
ClassDescriptionAbstractCharacterInput<D,
T, U extends Parser.Token<D, T>> Character input source.AbstractExpression<D,T, A> Action<R,M, O> Base class of the parsing search-tree monad.Action.BiContinuation<R,S, T, M, O> Functional interface for binary continuations.Action.Continuation<R,S, M, O> Functional interface for continuations.Action.Trampoline<R,S, M, O> Action.Visitor<R,M, O> AtomicData<T>Blockage<R,M, O> Choice<R,M, O> Choice node class of the parsing search-tree monad.Content<D,T> Abstract base class of AST data.Data.View<A>Functional interface for interpretation views of AST data.Diagnosis<R,M, O> Expression<D,T, A> Expression.Result<D,T, A> Fragment<D,T, A> MapChange<K,V, M> Parser<D,T> Combinatorial nondeterministic parser building blocks.Parser.Input<D,T> Abstract interface of immutable parser input states.Parser.Output<D,T> Immutable parser transition outputs.Enumeration of local pragmatic modifiers of parsing behavior.Parser.Proxy<D,T> Parser.Token<D,T> Abstract interface of parser tokens.bodyis eventually to be called withargsand three additional inputs.Framework factories for procedural AST construction.Indicates that the creation of an AST node has been aborted deliberately due to semantic errors in the input.Reducer.Collector1<D,A1> Reducer.Collector2<D,A1, A2> Reducer.Collector3<D,A1, A2, A3> Reducer.Collector4<D,A1, A2, A3, A4> Reducer.Collector5<D,A1, A2, A3, A4, A5> Reducer.Collector6<D,A1, A2, A3, A4, A5, A6> Reducer.Collector7<D,A1, A2, A3, A4, A5, A6, A7> Abstract base of all AST node-constructor functional interfaces.Reducer.Constructor1<D,A1, R> Functional interface for AST node constructors with one parsed argument.Reducer.Constructor2<D,A1, A2, R> Reducer.Constructor3<D,A1, A2, A3, R> Reducer.Constructor4<D,A1, A2, A3, A4, R> Reducer.Constructor5<D,A1, A2, A3, A4, A5, R> Reducer.Constructor6<D,A1, A2, A3, A4, A5, A6, R> Reducer.Constructor7<D,A1, A2, A3, A4, A5, A6, A7, R> ReverseList<A>Generic, immutable, reverse single-linked lists.ReverseMap<K,V> SimpleReverseMap<K,V> Immutable semantic parsing state for AST construction.Success<R,M, O> Leaf node class of the parsing search-tree monad.Thunk<R,S, M, O> A class with no information content.Update<M>