Uses of Class
eu.bandm.tools.ramus.runtime2.Reading

Packages that use Reading

Package	Description
eu.bandm.tools.ramus.runtime2

Uses of Reading in eu.bandm.tools.ramus.runtime2

Methods in eu.bandm.tools.ramus.runtime2 that return Reading

Modifier and Type	Method	Description
static <D, T, A> Reading<D,T,A>	Reading.access(Class<A> type, Object key)	Retrieve the value assigned to a given key as the semantic interpretation.
<B, C> Reading<D,T,C>	Reading.andThenCombining(Reading<D,T,B> other, BiFunction<? super A,? super B,? extends C> pair)	Match the syntax of this expression followed by that of another, combining the semantic interpretations with a function.
<B> Reading<D,T,B>	Reading.andThenDependent(Reading<D,T,Function<? super A,? extends B>> other)	Match the syntax of this expression followed by that of another, combining the semantic interpretations.
Reading<D,T,A>	Reading.append(Parser<D,T> suffix)	Match the syntax of this token with a suffix, with the same semantic interpretation.
Reading<D,T,A>	Reading.append(T suffix)	Match the syntax of this token with a suffix, with the same semantic interpretation.
final Reading<D,T,A>	Reading.append(T... prefix)	Match the syntax of this token with a suffix, with the same semantic interpretation.
Reading<D,T,A>	Reading.assigning(Object key)	Match the same syntax as this expression, and assign the semantic interpretation to a given key.
static <D, T, A> Reading<D,T,A>	Reading.choice(Reading<D,T,? extends A>... alts)
static <D, T, A> Reading<D,T,A>	Reading.constant(Parser<D,T> syntax, A value)	Match the given syntax with a constant semantic interpretation.
static <D, T, A> Reading<D,T,A>	Reading.constant(T type, A value)	Match the given syntax with a constant semantic interpretation.
static <D, T, A> Reading<D,T,A>	Reading.constant(T type, String text, A value)	Match the given syntax with a constant semantic interpretation.
static <D, T, A> Reading<D,T,A>	Reading.constantEpsilon(A value)	Match no input with a constant semantic interpretation.
static <D, T> Reading<D,T,Content<D,T>>	Reading.content(Parser<D,T> syntax)
static <D, T> Reading<D,T,Content<D,T>>	Reading.content(T... types)	Match a token of any of the given token types and interpret as its content.
static <D, T, A> Reading<D,T,A>	Reading.counit(A value)
static <D, T, A> Reading<D,T,A>	Reading.fix(Function<Reading<D,T,A>,Reading<D,T,A>> loop)	Make a recursive expression.
Reading<D,T,A>	Reading.guard(Predicate<? super A> condition, Function<? super A,List<SimpleMessage<D>>> error)
static <D, T, A> Reading<D,T,A>	Reading.ifThenElse(T type, Reading<D,T,? extends A> thenBranch, Reading<D,T,? extends A> elseBranch)	Choose between two expression depending on the type of the next token.
static <D, T, A> Reading<D,T,A>	Reading.leftAssoc(Reading.OperatorFactory<D,T,A> operator, Reading<D,T,A> operand, T... operatorTypes)	Tactic for left-associative operators.
static <D, T, A> Reading<D,T,A>	Reading.leftAssoc(Reading<D,T,A> headOperand, Reading.OperatorFactory<D,T,A> operator, Reading<D,T,A> tailOperand, T... operatorTypes)
static <D, T, A> Reading<D,T,A>	Reading.lookahead(Map<T,Reading<D,T,? extends A>> map)
static <D, T, A> Reading<D,T,A>	Reading.lookup(Class<A> type, Map<T,? extends A> model)
static <D, T, A> Reading<D,T,A>	Reading.lookup(Map<T,? extends A> model)
<B> Reading<D,T,B>	Reading.map(Function<? super A,? extends B> fun)	Match the same syntax as this expression, and apply a function to the result of semantic interpretation.
<B> Reading<D,T,Map.Entry<A,B>>	Reading.mapsTo(Reading<D,T,B> other)	Match the syntax of this expression followed by that of another, combining the semantic interpretations as a Map.Entry.
static <D, T, A> Reading<D,T,A>	Reading.nonAssoc(Reading.OperatorFactory<D,T,A> operator, Reading<D,T,A> operand, T... operatorTypes)	Tactic for non-associative operators.
Reading<D,T,Optional<A>>	Reading.optional(Parser.Pragma... pragmas)	Match the syntax of this token with the same interpretation, or otherwise match no input.
Reading<D,T,Optional<A>>	Reading.optional(T defaultType)	Match the syntax of this token with the same interpretation, or otherwise match no input.
Reading<D,T,A>	Reading.orElse(A defaultValue, Parser.Pragma... pragmas)	Match the syntax of this token with the same interpretation, or otherwise match no input with the given default interpretation.
Reading<D,T,A>	Reading.orElse(Reading<D,T,A> other)
Reading<D,T,A>	Reading.orElseGet(Supplier<? extends A> defaultValue, Parser.Pragma... pragmas)	Match the syntax of this token with the same interpretation, or otherwise match no input with the given default interpretation.
Reading<D,T,List<A>>	Reading.plus(Parser.Pragma... pragmas)	Match one or more repetitions of this expression.
Reading<D,T,List<A>>	Reading.plus(Parser<D,T> sep, Parser.Pragma... pragmas)	Match one or more repetitions of this expression with intervening separator syntax.
Reading<D,T,List<A>>	Reading.plus(T sep, Parser.Pragma... pragmas)	Match one or more repetitions of this expression with intervening separator syntax.
Reading<D,T,A>	Reading.prepend(Parser<D,T> prefix)	Match the syntax of this token with a prefix, with the same semantic interpretation.
Reading<D,T,A>	Reading.prepend(T prefix)	Match the syntax of this token with a prefix, with the same semantic interpretation.
final Reading<D,T,A>	Reading.prepend(T... suffix)	Match the syntax of this token with a prefix, with the same semantic interpretation.
static <D, T, A1, R> Reading<D,T,R>	Reducer.reduce(@Opt Class<R> type, Reducer.Constructor1<D,A1,? extends R> cons, Reading<D,T,? extends A1> arg1)
static <D, T, A1, A2, R> Reading<D,T,R>	Reducer.reduce(@Opt Class<R> type, Reducer.Constructor2<D,A1,A2,R> cons, Reading<D,T,? extends A1> arg1, Reading<D,T,? extends A2> arg2)
static <D, T, A1, A2, A3, R> Reading<D,T,R>	Reducer.reduce(@Opt Class<R> type, Reducer.Constructor3<D,A1,A2,A3,R> cons, Reading<D,T,? extends A1> arg1, Reading<D,T,? extends A2> arg2, Reading<D,T,? extends A3> arg3)
static <D, T, A1, A2, A3, A4, R> Reading<D,T,R>	Reducer.reduce(@Opt Class<R> type, Reducer.Constructor4<D,A1,A2,A3,A4,R> cons, Reading<D,T,? extends A1> arg1, Reading<D,T,? extends A2> arg2, Reading<D,T,? extends A3> arg3, Reading<D,T,? extends A4> arg4)
static <D, T, A1, R> Reading<D,T,R>	Reducer.reduce(Reducer.Constructor1<D,A1,? extends R> cons, Reading<D,T,? extends A1> arg1)
static <D, T, A1, A2, R> Reading<D,T,R>	Reducer.reduce(Reducer.Constructor2<D,A1,A2,R> cons, Reading<D,T,? extends A1> arg1, Reading<D,T,? extends A2> arg2)
static <D, T, A1, A2, A3, R> Reading<D,T,R>	Reducer.reduce(Reducer.Constructor3<D,A1,A2,A3,R> cons, Reading<D,T,? extends A1> arg1, Reading<D,T,? extends A2> arg2, Reading<D,T,? extends A3> arg3)
static <D, T, A1, A2, A3, A4, R> Reading<D,T,R>	Reducer.reduce(Reducer.Constructor4<D,A1,A2,A3,A4,R> cons, Reading<D,T,? extends A1> arg1, Reading<D,T,? extends A2> arg2, Reading<D,T,? extends A3> arg3, Reading<D,T,? extends A4> arg4)
static <D, T, A> Reading<D,T,A>	Reading.rightAssoc(Reading.OperatorFactory<D,T,A> operator, Reading<D,T,A> operand, T... operatorTypes)	Tactic for right-associative operators.
Reading<D,T,List<A>>	Reading.star(Parser.Pragma... pragmas)	Match zero or more repetitions of this expression.
Reading<D,T,List<A>>	Reading.star(Parser<D,T> sep, Parser.Pragma... pragmas)	Match zero or more repetitions of this expression with intervening separator syntax.
Reading<D,T,List<A>>	Reading.star(T sep, Parser.Pragma... pragmas)	Match zero or more repetitions of this expression with intervening separator syntax.
static <D, T> Reading<D,T,String>	Reading.text(T... types)	Match a token of any of the given token types and interpret as its text.
static <D, T> Reading<D,T,T>	Reading.type(T... types)	Match a token of any of the given token types and interpret as its type.
static <D, T> Reading<D,T,Void>	Reading.unit()	Match no input with no semantic interpretation.
static <D, T> Reading<D,T,Void>	Reading.unit(Parser<D,T> syntax)	Match the given syntax with no semantic interpretation.
static <D, T> Reading<D,T,Void>	Reading.unit(T... types)	Match the given syntax with no semantic interpretation.
<K, L> Reading<D,T,A>	Reading.withOtherTokenSource(LookaheadTokenMultiplexer<K,D,T,L> multi, K newKey)
Reading<D,T,A>	Reading.withScope(Map<Object,? extends Data> initializers)	Match the same syntax as this expression, but perform semantic interpretation in a local scope.
Reading<D,T,A>	Reading.wrap(Parser<D,T> prefix, Parser<D,T> suffix)	Match the syntax of this token with a prefix and a suffix, with the same semantic interpretation.
Reading<D,T,A>	Reading.wrap(T prefix, T suffix)	Match the syntax of this token with a prefix and a suffix, with the same semantic interpretation.

Methods in eu.bandm.tools.ramus.runtime2 with parameters of type Reading

Modifier and Type	Method	Description
<B, C> Reading<D,T,C>	Reading.andThenCombining(Reading<D,T,B> other, BiFunction<? super A,? super B,? extends C> pair)	Match the syntax of this expression followed by that of another, combining the semantic interpretations with a function.
<B> Reading<D,T,B>	Reading.andThenDependent(Reading<D,T,Function<? super A,? extends B>> other)	Match the syntax of this expression followed by that of another, combining the semantic interpretations.
static <D, T, A> Reading<D,T,A>	Reading.choice(Reading<D,T,? extends A>... alts)
static <D, T, A> Reading<D,T,A>	Reading.ifThenElse(T type, Reading<D,T,? extends A> thenBranch, Reading<D,T,? extends A> elseBranch)	Choose between two expression depending on the type of the next token.
static <D, T, A> Reading<D,T,A>	Reading.leftAssoc(Reading.OperatorFactory<D,T,A> operator, Reading<D,T,A> operand, T... operatorTypes)	Tactic for left-associative operators.
static <D, T, A> Reading<D,T,A>	Reading.leftAssoc(Reading<D,T,A> headOperand, Reading.OperatorFactory<D,T,A> operator, Reading<D,T,A> tailOperand, T... operatorTypes)
<B> Reading<D,T,Map.Entry<A,B>>	Reading.mapsTo(Reading<D,T,B> other)	Match the syntax of this expression followed by that of another, combining the semantic interpretations as a Map.Entry.
static <D, T, A> Reading<D,T,A>	Reading.nonAssoc(Reading.OperatorFactory<D,T,A> operator, Reading<D,T,A> operand, T... operatorTypes)	Tactic for non-associative operators.
Reading<D,T,A>	Reading.orElse(Reading<D,T,A> other)
static <D, T, A1, R> Reading<D,T,R>	Reducer.reduce(@Opt Class<R> type, Reducer.Constructor1<D,A1,? extends R> cons, Reading<D,T,? extends A1> arg1)
static <D, T, A1, A2, R> Reading<D,T,R>	Reducer.reduce(@Opt Class<R> type, Reducer.Constructor2<D,A1,A2,R> cons, Reading<D,T,? extends A1> arg1, Reading<D,T,? extends A2> arg2)
static <D, T, A1, A2, A3, R> Reading<D,T,R>	Reducer.reduce(@Opt Class<R> type, Reducer.Constructor3<D,A1,A2,A3,R> cons, Reading<D,T,? extends A1> arg1, Reading<D,T,? extends A2> arg2, Reading<D,T,? extends A3> arg3)
static <D, T, A1, A2, A3, A4, R> Reading<D,T,R>	Reducer.reduce(@Opt Class<R> type, Reducer.Constructor4<D,A1,A2,A3,A4,R> cons, Reading<D,T,? extends A1> arg1, Reading<D,T,? extends A2> arg2, Reading<D,T,? extends A3> arg3, Reading<D,T,? extends A4> arg4)
static <D, T, A1, R> Reading<D,T,R>	Reducer.reduce(Reducer.Constructor1<D,A1,? extends R> cons, Reading<D,T,? extends A1> arg1)
static <D, T, A1, A2, R> Reading<D,T,R>	Reducer.reduce(Reducer.Constructor2<D,A1,A2,R> cons, Reading<D,T,? extends A1> arg1, Reading<D,T,? extends A2> arg2)
static <D, T, A1, A2, A3, R> Reading<D,T,R>	Reducer.reduce(Reducer.Constructor3<D,A1,A2,A3,R> cons, Reading<D,T,? extends A1> arg1, Reading<D,T,? extends A2> arg2, Reading<D,T,? extends A3> arg3)
static <D, T, A1, A2, A3, A4, R> Reading<D,T,R>	Reducer.reduce(Reducer.Constructor4<D,A1,A2,A3,A4,R> cons, Reading<D,T,? extends A1> arg1, Reading<D,T,? extends A2> arg2, Reading<D,T,? extends A3> arg3, Reading<D,T,? extends A4> arg4)
static <D, T, A> Reading<D,T,A>	Reading.rightAssoc(Reading.OperatorFactory<D,T,A> operator, Reading<D,T,A> operand, T... operatorTypes)	Tactic for right-associative operators.

Method parameters in eu.bandm.tools.ramus.runtime2 with type arguments of type Reading

Modifier and Type	Method	Description
static <D, T, A> Reading<D,T,A>	Reading.fix(Function<Reading<D,T,A>,Reading<D,T,A>> loop)	Make a recursive expression.
static <D, T, A> Reading<D,T,A>	Reading.fix(Function<Reading<D,T,A>,Reading<D,T,A>> loop)	Make a recursive expression.
static <D, T, A> Reading<D,T,A>	Reading.lookahead(Map<T,Reading<D,T,? extends A>> map)