class ReductionRule3_4[-X, -Y, -Z, +A, +B, +C, +D] extends ReductionRule
A rule taking three values off the value stack and replacing them with four values.
- Alphabetic
- By Inheritance
- ReductionRule3_4
- ReductionRule
- Rule
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
- new ReductionRule3_4(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[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
label(label: String): ReductionRule3_4.this.type
- Definition Classes
- Rule
-
val
matcher: Matcher
- Definition Classes
- ReductionRule3_4 → Rule
-
def
memoMismatches: ReductionRule3_4.this.type
- Definition Classes
- Rule
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
skipNode: ReductionRule3_4.this.type
- Definition Classes
- Rule
-
def
suppressNode: ReductionRule3_4.this.type
- Definition Classes
- Rule
-
def
suppressSubnodes: ReductionRule3_4.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(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
withMatcher(matcher: Matcher): ReductionRule3_4.this.type
- Attributes
- protected
- Definition Classes
- ReductionRule3_4 → Rule
- def |[XX <: X, YY <: Y, ZZ <: Z, AA >: A, BB >: B, CC >: C, DD >: D](other: ReductionRule3_4[XX, YY, ZZ, AA, BB, CC, DD]): ReductionRule3_4[XX, YY, ZZ, AA, BB, CC, DD]
- def ~[E, F, G](other: Rule3[E, F, G]): ReductionRule3_7[X, Y, Z, A, B, C, D, E, F, G]
- def ~[E, F](other: Rule2[E, F]): ReductionRule3_6[X, Y, Z, A, B, C, D, E, F]
- def ~[E](other: Rule1[E]): ReductionRule3_5[X, Y, Z, A, B, C, D, E]
- def ~[DD >: D, RD, E, F, G](other: ReductionRule1_4[DD, RD, E, F, G]): ReductionRule3_7[X, Y, Z, A, B, C, RD, E, F, G]
- def ~[DD >: D, RD, E, F](other: ReductionRule1_3[DD, RD, E, F]): ReductionRule3_6[X, Y, Z, A, B, C, RD, E, F]
- def ~[DD >: D, RD, E](other: ReductionRule1_2[DD, RD, E]): ReductionRule3_5[X, Y, Z, A, B, C, RD, E]
- def ~[DD >: D, RD](other: ReductionRule1[DD, RD]): ReductionRule3_4[X, Y, Z, A, B, C, RD]
- def ~[CC >: C, DD >: D, RC, RD, E, F, G](other: ReductionRule2_5[CC, DD, RC, RD, E, F, G]): ReductionRule3_7[X, Y, Z, A, B, RC, RD, E, F, G]
- def ~[CC >: C, DD >: D, RC, RD, E, F](other: ReductionRule2_4[CC, DD, RC, RD, E, F]): ReductionRule3_6[X, Y, Z, A, B, RC, RD, E, F]
- def ~[CC >: C, DD >: D, RC, RD, E](other: ReductionRule2_3[CC, DD, RC, RD, E]): ReductionRule3_5[X, Y, Z, A, B, RC, RD, E]
- def ~[CC >: C, DD >: D, RC, RD](other: ReductionRule2_2[CC, DD, RC, RD]): ReductionRule3_4[X, Y, Z, A, B, RC, RD]
- def ~[CC >: C, DD >: D, RC](other: ReductionRule2[CC, DD, RC]): ReductionRule3_3[X, Y, Z, A, B, RC]
- def ~[BB >: B, CC >: C, DD >: D, RB, RC, RD, E, F, G](other: ReductionRule3_6[BB, CC, DD, RB, RC, RD, E, F, G]): ReductionRule3_7[X, Y, Z, A, RB, RC, RD, E, F, G]
- def ~[BB >: B, CC >: C, DD >: D, RB, RC, RD, E, F](other: ReductionRule3_5[BB, CC, DD, RB, RC, RD, E, F]): ReductionRule3_6[X, Y, Z, A, RB, RC, RD, E, F]
- def ~[BB >: B, CC >: C, DD >: D, RB, RC, RD, E](other: ReductionRule3_4[BB, CC, DD, RB, RC, RD, E]): ReductionRule3_5[X, Y, Z, A, RB, RC, RD, E]
- def ~[BB >: B, CC >: C, DD >: D, RB, RC, RD](other: ReductionRule3_3[BB, CC, DD, RB, RC, RD]): ReductionRule3_4[X, Y, Z, A, RB, RC, RD]
- def ~[BB >: B, CC >: C, DD >: D, RB, RC](other: ReductionRule3_2[BB, CC, DD, RB, RC]): ReductionRule3_3[X, Y, Z, A, RB, RC]
- def ~[BB >: B, CC >: C, DD >: D, RB](other: ReductionRule3[BB, CC, DD, RB]): ReductionRule3_2[X, Y, Z, A, RB]
- def ~[DD >: D](other: PopRule1[DD]): ReductionRule3_3[X, Y, Z, A, B, C]
- def ~[CC >: C, DD >: D](other: PopRule2[CC, DD]): ReductionRule3_2[X, Y, Z, A, B]
- def ~[BB >: B, CC >: C, DD >: D](other: PopRule3[BB, CC, DD]): ReductionRule3[X, Y, Z, A]
-
def
~(other: Rule0): ReductionRule3_4.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): ReductionRule3_4.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): ReductionRule3_4.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): ReductionRule3_4.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): ReductionRule3_4.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: (D) ⇒ Unit): ReductionRule3_3[X, Y, Z, A, B, C]
- def ~~%(f: (C, D) ⇒ Unit): ReductionRule3_2[X, Y, Z, A, B]
- def ~~%(f: (B, C, D) ⇒ Unit): ReductionRule3[X, Y, Z, A]
- def ~~%(f: (A, B, C, D) ⇒ Unit): PopRule3[X, Y, Z]
- def ~~>[RD](f: (D) ⇒ RD): ReductionRule3_4[X, Y, Z, A, B, C, RD]
- def ~~>[RC](f: (C, D) ⇒ RC): ReductionRule3_3[X, Y, Z, A, B, RC]
- def ~~>[RB](f: (B, C, D) ⇒ RB): ReductionRule3_2[X, Y, Z, A, RB]
- def ~~>[RA](f: (A, B, C, D) ⇒ RA): ReductionRule3[X, Y, Z, RA]
- def ~~?(f: (D) ⇒ Boolean): ReductionRule3_3[X, Y, Z, A, B, C]
- def ~~?(f: (C, D) ⇒ Boolean): ReductionRule3_2[X, Y, Z, A, B]
- def ~~?(f: (B, C, D) ⇒ Boolean): ReductionRule3[X, Y, Z, A]
- def ~~?(f: (A, B, C, D) ⇒ Boolean): PopRule3[X, Y, Z]
- def ~~~%(f: (D) ⇒ Unit): ReductionRule3_4[X, Y, Z, A, B, C, D]
- def ~~~%(f: (C, D) ⇒ Unit): ReductionRule3_4[X, Y, Z, A, B, C, D]
- def ~~~%(f: (B, C, D) ⇒ Unit): ReductionRule3_4[X, Y, Z, A, B, C, D]
- def ~~~%(f: (A, B, C, D) ⇒ Unit): ReductionRule3_4[X, Y, Z, A, B, C, D]
- def ~~~?(f: (D) ⇒ Boolean): ReductionRule3_4[X, Y, Z, A, B, C, D]
- def ~~~?(f: (C, D) ⇒ Boolean): ReductionRule3_4[X, Y, Z, A, B, C, D]
- def ~~~?(f: (B, C, D) ⇒ Boolean): ReductionRule3_4[X, Y, Z, A, B, C, D]
- def ~~~?(f: (A, B, C, D) ⇒ Boolean): ReductionRule3_4[X, Y, Z, A, B, C, D]