class ReductionRule2_5[-Y, -Z, +A, +B, +C, +D, +E] extends ReductionRule
A rule taking two values off the value stack and replacing them with five values.
- Alphabetic
- By Inheritance
- ReductionRule2_5
- ReductionRule
- Rule
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new ReductionRule2_5(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): ReductionRule2_5.this.type
- Definition Classes
- Rule
- val matcher: Matcher
- Definition Classes
- ReductionRule2_5 → Rule
- def memoMismatches: ReductionRule2_5.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: ReductionRule2_5.this.type
- Definition Classes
- Rule
- def suppressNode: ReductionRule2_5.this.type
- Definition Classes
- Rule
- def suppressSubnodes: ReductionRule2_5.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): ReductionRule2_5.this.type
- Attributes
- protected
- Definition Classes
- ReductionRule2_5 → Rule
- def |[YY <: Y, ZZ <: Z, AA >: A, BB >: B, CC >: C, DD >: D, EE >: E](other: ReductionRule2_5[YY, ZZ, AA, BB, CC, DD, EE]): ReductionRule2_5[YY, ZZ, AA, BB, CC, DD, EE]
- def ~[F, G](other: Rule2[F, G]): ReductionRule2_7[Y, Z, A, B, C, D, E, F, G]
- def ~[F](other: Rule1[F]): ReductionRule2_6[Y, Z, A, B, C, D, E, F]
- def ~[EE >: E, RE, F, G](other: ReductionRule1_3[EE, RE, F, G]): ReductionRule2_7[Y, Z, A, B, C, D, RE, F, G]
- def ~[EE >: E, RE, F](other: ReductionRule1_2[EE, RE, F]): ReductionRule2_6[Y, Z, A, B, C, D, RE, F]
- def ~[EE >: E, RE](other: ReductionRule1[EE, RE]): ReductionRule2_5[Y, Z, A, B, C, D, RE]
- def ~[DD >: D, EE >: E, RD, RE, F, G](other: ReductionRule2_4[DD, EE, RD, RE, F, G]): ReductionRule2_7[Y, Z, A, B, C, RD, RE, F, G]
- def ~[DD >: D, EE >: E, RD, RE, F](other: ReductionRule2_3[DD, EE, RD, RE, F]): ReductionRule2_6[Y, Z, A, B, C, RD, RE, F]
- def ~[DD >: D, EE >: E, RD, RE](other: ReductionRule2_2[DD, EE, RD, RE]): ReductionRule2_5[Y, Z, A, B, C, RD, RE]
- def ~[DD >: D, EE >: E, RD](other: ReductionRule2[DD, EE, RD]): ReductionRule2_4[Y, Z, A, B, C, RD]
- def ~[CC >: C, DD >: D, EE >: E, RC, RD, RE, F, G](other: ReductionRule3_5[CC, DD, EE, RC, RD, RE, F, G]): ReductionRule2_7[Y, Z, A, B, RC, RD, RE, F, G]
- def ~[CC >: C, DD >: D, EE >: E, RC, RD, RE, F](other: ReductionRule3_4[CC, DD, EE, RC, RD, RE, F]): ReductionRule2_6[Y, Z, A, B, RC, RD, RE, F]
- def ~[CC >: C, DD >: D, EE >: E, RC, RD, RE](other: ReductionRule3_3[CC, DD, EE, RC, RD, RE]): ReductionRule2_5[Y, Z, A, B, RC, RD, RE]
- def ~[CC >: C, DD >: D, EE >: E, RC, RD](other: ReductionRule3_2[CC, DD, EE, RC, RD]): ReductionRule2_4[Y, Z, A, B, RC, RD]
- def ~[CC >: C, DD >: D, EE >: E, RC](other: ReductionRule3[CC, DD, EE, RC]): ReductionRule2_3[Y, Z, A, B, RC]
- def ~[EE >: E](other: PopRule1[EE]): ReductionRule2_4[Y, Z, A, B, C, D]
- def ~[DD >: D, EE >: E](other: PopRule2[DD, EE]): ReductionRule2_3[Y, Z, A, B, C]
- def ~[CC >: C, DD >: D, EE >: E](other: PopRule3[CC, DD, EE]): ReductionRule2_2[Y, Z, A, B]
- def ~(other: Rule0): ReductionRule2_5.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): ReductionRule2_5.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): ReductionRule2_5.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): ReductionRule2_5.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): ReductionRule2_5.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: (E) => Unit): ReductionRule2_4[Y, Z, A, B, C, D]
- def ~~%(f: (D, E) => Unit): ReductionRule2_3[Y, Z, A, B, C]
- def ~~%(f: (C, D, E) => Unit): ReductionRule2_2[Y, Z, A, B]
- def ~~%(f: (B, C, D, E) => Unit): ReductionRule2[Y, Z, A]
- def ~~%(f: (A, B, C, D, E) => Unit): PopRule2[Y, Z]
- def ~~%[X](f: (X, A, B, C, D, E) => Unit): PopRule3[X, Y, Z]
- def ~~>[RE](f: (E) => RE): ReductionRule2_5[Y, Z, A, B, C, D, RE]
- def ~~>[RD](f: (D, E) => RD): ReductionRule2_4[Y, Z, A, B, C, RD]
- def ~~>[RC](f: (C, D, E) => RC): ReductionRule2_3[Y, Z, A, B, RC]
- def ~~>[RB](f: (B, C, D, E) => RB): ReductionRule2_2[Y, Z, A, RB]
- def ~~>[RA](f: (A, B, C, D, E) => RA): ReductionRule2[Y, Z, RA]
- def ~~>[X, RA](f: (X, A, B, C, D, E) => RA): ReductionRule3[X, Y, Z, RA]
- def ~~?(f: (E) => Boolean): ReductionRule2_4[Y, Z, A, B, C, D]
- def ~~?(f: (D, E) => Boolean): ReductionRule2_3[Y, Z, A, B, C]
- def ~~?(f: (C, D, E) => Boolean): ReductionRule2_2[Y, Z, A, B]
- def ~~?(f: (B, C, D, E) => Boolean): ReductionRule2[Y, Z, A]
- def ~~?(f: (A, B, C, D, E) => Boolean): PopRule2[Y, Z]
- def ~~?[X](f: (X, A, B, C, D, E) => Boolean): PopRule3[X, Y, Z]
- def ~~~%(f: (E) => Unit): ReductionRule2_5[Y, Z, A, B, C, D, E]
- def ~~~%(f: (D, E) => Unit): ReductionRule2_5[Y, Z, A, B, C, D, E]
- def ~~~%(f: (C, D, E) => Unit): ReductionRule2_5[Y, Z, A, B, C, D, E]
- def ~~~%(f: (B, C, D, E) => Unit): ReductionRule2_5[Y, Z, A, B, C, D, E]
- def ~~~%(f: (A, B, C, D, E) => Unit): ReductionRule2_5[Y, Z, A, B, C, D, E]
- def ~~~?(f: (E) => Boolean): ReductionRule2_5[Y, Z, A, B, C, D, E]
- def ~~~?(f: (D, E) => Boolean): ReductionRule2_5[Y, Z, A, B, C, D, E]
- def ~~~?(f: (C, D, E) => Boolean): ReductionRule2_5[Y, Z, A, B, C, D, E]
- def ~~~?(f: (B, C, D, E) => Boolean): ReductionRule2_5[Y, Z, A, B, C, D, E]
- def ~~~?(f: (A, B, C, D, E) => Boolean): ReductionRule2_5[Y, Z, A, B, C, D, E]
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
(Since version 9)