org.parboiled.scala.rules

ReductionRule3_3

class ReductionRule3_3[-X, -Y, -Z, +A, +B, +C] extends ReductionRule

A rule taking three values off the value stack and replacing them with three values.

Linear Supertypes
ReductionRule, Rule, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. ReductionRule3_3
  2. ReductionRule
  3. Rule
  4. AnyRef
  5. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ReductionRule3_3(matcher: Matcher)

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  6. def append(other: Matcher): Matcher

    Attributes
    protected
    Definition Classes
    Rule
  7. def append(other: Rule): Matcher

    Attributes
    protected
    Definition Classes
    Rule
  8. def append(f: (Context[Any]) ⇒ Boolean): Matcher

    Attributes
    protected
    Definition Classes
    Rule
  9. def append(action: Action[_]): Matcher

    Attributes
    protected
    Definition Classes
    Rule
  10. def appendChoice(other: Matcher): Matcher

    Attributes
    protected
    Definition Classes
    Rule
  11. def appendChoice(other: Rule): Matcher

    Attributes
    protected
    Definition Classes
    Rule
  12. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  13. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  14. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  15. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  16. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  17. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  18. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  19. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  20. def label(label: String): ReductionRule3_3.this.type

    Definition Classes
    Rule
  21. val matcher: Matcher

    Definition Classes
    ReductionRule3_3Rule
  22. def memoMismatches: ReductionRule3_3.this.type

    Definition Classes
    Rule
  23. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  24. final def notify(): Unit

    Definition Classes
    AnyRef
  25. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  26. def skipNode: ReductionRule3_3.this.type

    Definition Classes
    Rule
  27. def suppressNode: ReductionRule3_3.this.type

    Definition Classes
    Rule
  28. def suppressSubnodes: ReductionRule3_3.this.type

    Definition Classes
    Rule
  29. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  30. def toString(): String

    Definition Classes
    Rule → AnyRef → Any
  31. 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
  32. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  33. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  34. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  35. def withMatcher(matcher: Matcher): ReductionRule3_3.this.type

    Attributes
    protected
    Definition Classes
    ReductionRule3_3Rule
  36. def |[XX <: X, YY <: Y, ZZ <: Z, AA >: A, BB >: B, CC >: C](other: ReductionRule3_3[XX, YY, ZZ, AA, BB, CC]): ReductionRule3_3[XX, YY, ZZ, AA, BB, CC]

  37. def ~[D, E, F, G](other: Rule4[D, E, F, G]): ReductionRule3_7[X, Y, Z, A, B, C, D, E, F, G]

  38. def ~[D, E, F](other: Rule3[D, E, F]): ReductionRule3_6[X, Y, Z, A, B, C, D, E, F]

  39. def ~[D, E](other: Rule2[D, E]): ReductionRule3_5[X, Y, Z, A, B, C, D, E]

  40. def ~[D](other: Rule1[D]): ReductionRule3_4[X, Y, Z, A, B, C, D]

  41. def ~[CC >: C, RC, D, E, F, G](other: ReductionRule1_5[CC, RC, D, E, F, G]): ReductionRule3_7[X, Y, Z, A, B, RC, D, E, F, G]

  42. def ~[CC >: C, RC, D, E, F](other: ReductionRule1_4[CC, RC, D, E, F]): ReductionRule3_6[X, Y, Z, A, B, RC, D, E, F]

  43. def ~[CC >: C, RC, D, E](other: ReductionRule1_3[CC, RC, D, E]): ReductionRule3_5[X, Y, Z, A, B, RC, D, E]

  44. def ~[CC >: C, RC, D](other: ReductionRule1_2[CC, RC, D]): ReductionRule3_4[X, Y, Z, A, B, RC, D]

  45. def ~[CC >: C, RC](other: ReductionRule1[CC, RC]): ReductionRule3_3[X, Y, Z, A, B, RC]

  46. def ~[BB >: B, CC >: C, RB, RC, D, E, F, G](other: ReductionRule2_6[BB, CC, RB, RC, D, E, F, G]): ReductionRule3_7[X, Y, Z, A, RB, RC, D, E, F, G]

  47. def ~[BB >: B, CC >: C, RB, RC, D, E, F](other: ReductionRule2_5[BB, CC, RB, RC, D, E, F]): ReductionRule3_6[X, Y, Z, A, RB, RC, D, E, F]

  48. def ~[BB >: B, CC >: C, RB, RC, D, E](other: ReductionRule2_4[BB, CC, RB, RC, D, E]): ReductionRule3_5[X, Y, Z, A, RB, RC, D, E]

  49. def ~[BB >: B, CC >: C, RB, RC, D](other: ReductionRule2_3[BB, CC, RB, RC, D]): ReductionRule3_4[X, Y, Z, A, RB, RC, D]

  50. def ~[BB >: B, CC >: C, RB, RC](other: ReductionRule2_2[BB, CC, RB, RC]): ReductionRule3_3[X, Y, Z, A, RB, RC]

  51. def ~[BB >: B, CC >: C, RB](other: ReductionRule2[BB, CC, RB]): ReductionRule3_2[X, Y, Z, A, RB]

  52. def ~[AA >: A, BB >: B, CC >: C, RA, RB, RC, D, E, F, G](other: ReductionRule3_7[AA, BB, CC, RA, RB, RC, D, E, F, G]): ReductionRule3_7[X, Y, Z, RA, RB, RC, D, E, F, G]

  53. def ~[AA >: A, BB >: B, CC >: C, RA, RB, RC, D, E, F](other: ReductionRule3_6[AA, BB, CC, RA, RB, RC, D, E, F]): ReductionRule3_6[X, Y, Z, RA, RB, RC, D, E, F]

  54. def ~[AA >: A, BB >: B, CC >: C, RA, RB, RC, D, E](other: ReductionRule3_5[AA, BB, CC, RA, RB, RC, D, E]): ReductionRule3_5[X, Y, Z, RA, RB, RC, D, E]

  55. def ~[AA >: A, BB >: B, CC >: C, RA, RB, RC, D](other: ReductionRule3_4[AA, BB, CC, RA, RB, RC, D]): ReductionRule3_4[X, Y, Z, RA, RB, RC, D]

  56. def ~[AA >: A, BB >: B, CC >: C, RA, RB, RC](other: ReductionRule3_3[AA, BB, CC, RA, RB, RC]): ReductionRule3_3[X, Y, Z, RA, RB, RC]

  57. def ~[AA >: A, BB >: B, CC >: C, RA, RB](other: ReductionRule3_2[AA, BB, CC, RA, RB]): ReductionRule3_2[X, Y, Z, RA, RB]

  58. def ~[AA >: A, BB >: B, CC >: C, RA](other: ReductionRule3[AA, BB, CC, RA]): ReductionRule3[X, Y, Z, RA]

  59. def ~[CC >: C](other: PopRule1[CC]): ReductionRule3_2[X, Y, Z, A, B]

  60. def ~[BB >: B, CC >: C](other: PopRule2[BB, CC]): ReductionRule3[X, Y, Z, A]

  61. def ~[AA >: A, BB >: B, CC >: C](other: PopRule3[AA, BB, CC]): PopRule3[X, Y, Z]

  62. def ~(other: Rule0): ReductionRule3_3.this.type

    Connects two rules into a rule a sequence.

    Connects two rules into a rule a sequence.

    Definition Classes
    Rule
  63. def ~%(f: (String) ⇒ Unit): ReductionRule3_3.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
  64. def ~:%(f: (Char) ⇒ Unit): ReductionRule3_3.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
  65. def ~:?(f: (Char) ⇒ Boolean): ReductionRule3_3.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
  66. def ~?(f: (String) ⇒ Boolean): ReductionRule3_3.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
  67. def ~~%(f: (C) ⇒ Unit): ReductionRule3_2[X, Y, Z, A, B]

  68. def ~~%(f: (B, C) ⇒ Unit): ReductionRule3[X, Y, Z, A]

  69. def ~~%(f: (A, B, C) ⇒ Unit): PopRule3[X, Y, Z]

  70. def ~~>[RC](f: (C) ⇒ RC): ReductionRule3_3[X, Y, Z, A, B, RC]

  71. def ~~>[RB](f: (B, C) ⇒ RB): ReductionRule3_2[X, Y, Z, A, RB]

  72. def ~~>[RA](f: (A, B, C) ⇒ RA): ReductionRule3[X, Y, Z, RA]

  73. def ~~?(f: (C) ⇒ Boolean): ReductionRule3_2[X, Y, Z, A, B]

  74. def ~~?(f: (B, C) ⇒ Boolean): ReductionRule3[X, Y, Z, A]

  75. def ~~?(f: (A, B, C) ⇒ Boolean): PopRule3[X, Y, Z]

  76. def ~~~%(f: (C) ⇒ Unit): ReductionRule3_3[X, Y, Z, A, B, C]

  77. def ~~~%(f: (B, C) ⇒ Unit): ReductionRule3_3[X, Y, Z, A, B, C]

  78. def ~~~%(f: (A, B, C) ⇒ Unit): ReductionRule3_3[X, Y, Z, A, B, C]

  79. def ~~~?(f: (C) ⇒ Boolean): ReductionRule3_3[X, Y, Z, A, B, C]

  80. def ~~~?(f: (B, C) ⇒ Boolean): ReductionRule3_3[X, Y, Z, A, B, C]

  81. def ~~~?(f: (A, B, C) ⇒ Boolean): ReductionRule3_3[X, Y, Z, A, B, C]

Inherited from ReductionRule

Inherited from Rule

Inherited from AnyRef

Inherited from Any

Ungrouped