class ReductionRule1_6[-Z, +A, +B, +C, +D, +E, +F] extends ReductionRule
A rule taking one value off the value stack and replacing it with six values.
- Alphabetic
- By Inheritance
- ReductionRule1_6
- ReductionRule
- Rule
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new ReductionRule1_6(matcher: Matcher)
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def append(other: Matcher): Matcher
- Attributes
- protected
- Definition Classes
- Rule
- def append(other: Rule): Matcher
- Attributes
- protected
- Definition Classes
- Rule
- def append(f: (Context[Any]) => Boolean): Matcher
- Attributes
- protected
- Definition Classes
- Rule
- def append(action: Action[_]): Matcher
- Attributes
- protected
- Definition Classes
- Rule
- def appendChoice(other: Matcher): Matcher
- Attributes
- protected
- Definition Classes
- Rule
- def appendChoice(other: Rule): Matcher
- Attributes
- protected
- Definition Classes
- Rule
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @IntrinsicCandidate() @native()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @IntrinsicCandidate() @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @IntrinsicCandidate() @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def label(label: String): ReductionRule1_6.this.type
- Definition Classes
- Rule
- val matcher: Matcher
- Definition Classes
- ReductionRule1_6 → Rule
- def memoMismatches: ReductionRule1_6.this.type
- Definition Classes
- Rule
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @IntrinsicCandidate() @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @IntrinsicCandidate() @native()
- def skipNode: ReductionRule1_6.this.type
- Definition Classes
- Rule
- def suppressNode: ReductionRule1_6.this.type
- Definition Classes
- Rule
- def suppressSubnodes: ReductionRule1_6.this.type
- Definition Classes
- Rule
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- Rule → AnyRef → Any
- def unary_!: Rule0
Creates a "NOT" syntactic predicate according to the PEG formalism.
Creates a "NOT" syntactic predicate according to the PEG formalism.
- Definition Classes
- Rule
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- def withMatcher(matcher: Matcher): ReductionRule1_6.this.type
- Attributes
- protected
- Definition Classes
- ReductionRule1_6 → Rule
- def |[ZZ <: Z, AA >: A, BB >: B, CC >: C, DD >: D, EE >: E, FF >: F](other: ReductionRule1_6[ZZ, AA, BB, CC, DD, EE, FF]): ReductionRule1_6[ZZ, AA, BB, CC, DD, EE, FF]
- def ~[G](other: Rule1[G]): ReductionRule1_7[Z, A, B, C, D, E, F, G]
- def ~[FF >: F, RF, G](other: ReductionRule1_2[FF, RF, G]): ReductionRule1_7[Z, A, B, C, D, E, RF, G]
- def ~[FF >: F, RF](other: ReductionRule1[FF, RF]): ReductionRule1_6[Z, A, B, C, D, E, RF]
- def ~[EE >: E, FF >: F, RE, RF, G](other: ReductionRule2_3[EE, FF, RE, RF, G]): ReductionRule1_7[Z, A, B, C, D, RE, RF, G]
- def ~[EE >: E, FF >: F, RE, RF](other: ReductionRule2_2[EE, FF, RE, RF]): ReductionRule1_6[Z, A, B, C, D, RE, RF]
- def ~[EE >: E, FF >: F, RE](other: ReductionRule2[EE, FF, RE]): ReductionRule1_5[Z, A, B, C, D, RE]
- def ~[DD >: D, EE >: E, FF >: F, RD, RE, RF, G](other: ReductionRule3_4[DD, EE, FF, RD, RE, RF, G]): ReductionRule1_7[Z, A, B, C, RD, RE, RF, G]
- def ~[DD >: D, EE >: E, FF >: F, RD, RE, RF](other: ReductionRule3_3[DD, EE, FF, RD, RE, RF]): ReductionRule1_6[Z, A, B, C, RD, RE, RF]
- def ~[DD >: D, EE >: E, FF >: F, RD, RE](other: ReductionRule3_2[DD, EE, FF, RD, RE]): ReductionRule1_5[Z, A, B, C, RD, RE]
- def ~[DD >: D, EE >: E, FF >: F, RD](other: ReductionRule3[DD, EE, FF, RD]): ReductionRule1_4[Z, A, B, C, RD]
- def ~[FF >: F](other: PopRule1[FF]): ReductionRule1_5[Z, A, B, C, D, E]
- def ~[EE >: E, FF >: F](other: PopRule2[EE, FF]): ReductionRule1_4[Z, A, B, C, D]
- def ~[DD >: D, EE >: E, FF >: F](other: PopRule3[DD, EE, FF]): ReductionRule1_3[Z, A, B, C]
- def ~(other: Rule0): ReductionRule1_6.this.type
Connects two rules into a rule a sequence.
Connects two rules into a rule a sequence.
- Definition Classes
- Rule
- def ~%(f: (String) => Unit): ReductionRule1_6.this.type
Creates a simple parser action with the input text matched by the immediately preceding rule as parameter.
Creates a simple parser action with the input text matched by the immediately preceding rule as parameter.
- Definition Classes
- Rule
- def ~:%(f: (Char) => Unit): ReductionRule1_6.this.type
Creates a simple parser action with the first char of the input text matched by the immediately preceding rule as parameter.
Creates a simple parser action with the first char of the input text matched by the immediately preceding rule as parameter.
- Definition Classes
- Rule
- def ~:?(f: (Char) => Boolean): ReductionRule1_6.this.type
Creates a semantic predicate on the first char of the input text matched by the immediately preceding rule.
Creates a semantic predicate on the first char of the input text matched by the immediately preceding rule.
- Definition Classes
- Rule
- def ~?(f: (String) => Boolean): ReductionRule1_6.this.type
Creates a semantic predicate on the input text matched by the immediately preceding rule.
Creates a semantic predicate on the input text matched by the immediately preceding rule.
- Definition Classes
- Rule
- def ~~%(f: (F) => Unit): ReductionRule1_5[Z, A, B, C, D, E]
- def ~~%(f: (E, F) => Unit): ReductionRule1_4[Z, A, B, C, D]
- def ~~%(f: (D, E, F) => Unit): ReductionRule1_3[Z, A, B, C]
- def ~~%(f: (C, D, E, F) => Unit): ReductionRule1_2[Z, A, B]
- def ~~%(f: (B, C, D, E, F) => Unit): ReductionRule1[Z, A]
- def ~~%(f: (A, B, C, D, E, F) => Unit): PopRule1[Z]
- def ~~%[Y](f: (Y, A, B, C, D, E, F) => Unit): PopRule2[Y, Z]
- def ~~>[RF](f: (F) => RF): ReductionRule1_6[Z, A, B, C, D, E, RF]
- def ~~>[RE](f: (E, F) => RE): ReductionRule1_5[Z, A, B, C, D, RE]
- def ~~>[RD](f: (D, E, F) => RD): ReductionRule1_4[Z, A, B, C, RD]
- def ~~>[RC](f: (C, D, E, F) => RC): ReductionRule1_3[Z, A, B, RC]
- def ~~>[RB](f: (B, C, D, E, F) => RB): ReductionRule1_2[Z, A, RB]
- def ~~>[RA](f: (A, B, C, D, E, F) => RA): ReductionRule1[Z, RA]
- def ~~>[Y, RA](f: (Y, A, B, C, D, E, F) => RA): ReductionRule2[Y, Z, RA]
- def ~~?(f: (F) => Boolean): ReductionRule1_5[Z, A, B, C, D, E]
- def ~~?(f: (E, F) => Boolean): ReductionRule1_4[Z, A, B, C, D]
- def ~~?(f: (D, E, F) => Boolean): ReductionRule1_3[Z, A, B, C]
- def ~~?(f: (C, D, E, F) => Boolean): ReductionRule1_2[Z, A, B]
- def ~~?(f: (B, C, D, E, F) => Boolean): ReductionRule1[Z, A]
- def ~~?(f: (A, B, C, D, E, F) => Boolean): PopRule1[Z]
- def ~~?[Y](f: (Y, A, B, C, D, E, F) => Boolean): PopRule2[Y, Z]
- def ~~~%(f: (F) => Unit): ReductionRule1_6[Z, A, B, C, D, E, F]
- def ~~~%(f: (E, F) => Unit): ReductionRule1_6[Z, A, B, C, D, E, F]
- def ~~~%(f: (D, E, F) => Unit): ReductionRule1_6[Z, A, B, C, D, E, F]
- def ~~~%(f: (C, D, E, F) => Unit): ReductionRule1_6[Z, A, B, C, D, E, F]
- def ~~~%(f: (B, C, D, E, F) => Unit): ReductionRule1_6[Z, A, B, C, D, E, F]
- def ~~~%(f: (A, B, C, D, E, F) => Unit): ReductionRule1_6[Z, A, B, C, D, E, F]
- def ~~~?(f: (F) => Boolean): ReductionRule1_6[Z, A, B, C, D, E, F]
- def ~~~?(f: (E, F) => Boolean): ReductionRule1_6[Z, A, B, C, D, E, F]
- def ~~~?(f: (D, E, F) => Boolean): ReductionRule1_6[Z, A, B, C, D, E, F]
- def ~~~?(f: (C, D, E, F) => Boolean): ReductionRule1_6[Z, A, B, C, D, E, F]
- def ~~~?(f: (B, C, D, E, F) => Boolean): ReductionRule1_6[Z, A, B, C, D, E, F]
- def ~~~?(f: (A, B, C, D, E, F) => Boolean): ReductionRule1_6[Z, A, B, C, D, E, F]
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
(Since version 9)