org.parboiled.scala.rules

ReductionRule2_7

class ReductionRule2_7[-Y, -Z, +A, +B, +C, +D, +E, +F, +G] extends ReductionRule

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

Linear Supertypes
ReductionRule, Rule, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. ReductionRule2_7
  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 ReductionRule2_7(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): ReductionRule2_7.this.type

    Definition Classes
    Rule

  21. val matcher: Matcher

    Definition Classes
    ReductionRule2_7 → Rule

  22. def memoMismatches: ReductionRule2_7.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: ReductionRule2_7.this.type

    Definition Classes
    Rule

  27. def suppressNode: ReductionRule2_7.this.type

    Definition Classes
    Rule

  28. def suppressSubnodes: ReductionRule2_7.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): ReductionRule2_7.this.type

    Attributes
    protected
    Definition Classes
    ReductionRule2_7 → Rule

  36. def |[YY <: Y, ZZ <: Z, AA >: A, BB >: B, CC >: C, DD >: D, EE >: E, FF >: F, GG >: G](other: ReductionRule2_7[YY, ZZ, AA, BB, CC, DD, EE, FF, GG]): ReductionRule2_7[YY, ZZ, AA, BB, CC, DD, EE, FF, GG]

  37. def ~[GG >: G, RG](other: ReductionRule1[GG, RG]): ReductionRule2_7[Y, Z, A, B, C, D, E, F, RG]

  38. def ~[FF >: F, GG >: G, RF, RG](other: ReductionRule2_2[FF, GG, RF, RG]): ReductionRule2_7[Y, Z, A, B, C, D, E, F, G]

  39. def ~[FF >: F, GG >: G, RF](other: ReductionRule2[FF, GG, RF]): ReductionRule2_6[Y, Z, A, B, C, D, E, F]

  40. def ~[EE >: E, FF >: F, GG >: G, RE, RF, RG](other: ReductionRule3_3[EE, FF, GG, RE, RF, RG]): ReductionRule2_7[Y, Z, A, B, C, D, RE, RF, RG]

  41. def ~[EE >: E, FF >: F, GG >: G, RE, RF](other: ReductionRule3_2[EE, FF, GG, RE, RF]): ReductionRule2_6[Y, Z, A, B, C, D, RE, RF]

  42. def ~[EE >: E, FF >: F, GG >: G, RE](other: ReductionRule3[EE, FF, GG, RE]): ReductionRule2_5[Y, Z, A, B, C, D, RE]

  43. def ~[GG >: G](other: PopRule1[GG]): ReductionRule2_6[Y, Z, A, B, C, D, E, F]

  44. def ~[FF >: F, GG >: G](other: PopRule2[FF, GG]): ReductionRule2_5[Y, Z, A, B, C, D, E]

  45. def ~[EE >: E, FF >: F, GG >: G](other: PopRule3[EE, FF, GG]): ReductionRule2_4[Y, Z, A, B, C, D]

  46. def ~(other: Rule0): ReductionRule2_7.this.type

    Connects two rules into a rule a sequence.

    Connects two rules into a rule a sequence.

    Definition Classes
    Rule

  47. def ~%(f: (String) ⇒ Unit): ReductionRule2_7.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

  48. def ~:%(f: (Char) ⇒ Unit): ReductionRule2_7.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

  49. def ~:?(f: (Char) ⇒ Boolean): ReductionRule2_7.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

  50. def ~?(f: (String) ⇒ Boolean): ReductionRule2_7.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

  51. def ~~%(f: (G) ⇒ Unit): ReductionRule2_6[Y, Z, A, B, C, D, E, F]

  52. def ~~%(f: (F, G) ⇒ Unit): ReductionRule2_5[Y, Z, A, B, C, D, E]

  53. def ~~%(f: (E, F, G) ⇒ Unit): ReductionRule2_4[Y, Z, A, B, C, D]

  54. def ~~%(f: (D, E, F, G) ⇒ Unit): ReductionRule2_3[Y, Z, A, B, C]

  55. def ~~%(f: (C, D, E, F, G) ⇒ Unit): ReductionRule2_2[Y, Z, A, B]

  56. def ~~%(f: (B, C, D, E, F, G) ⇒ Unit): ReductionRule2[Y, Z, A]

  57. def ~~%(f: (A, B, C, D, E, F, G) ⇒ Unit): PopRule2[Y, Z]

  58. def ~~>[RG](f: (G) ⇒ RG): ReductionRule2_7[Y, Z, A, B, C, D, E, F, RG]

  59. def ~~>[RF](f: (F, G) ⇒ RF): ReductionRule2_6[Y, Z, A, B, C, D, E, RF]

  60. def ~~>[RE](f: (E, F, G) ⇒ RE): ReductionRule2_5[Y, Z, A, B, C, D, RE]

  61. def ~~>[RD](f: (D, E, F, G) ⇒ RD): ReductionRule2_4[Y, Z, A, B, C, RD]

  62. def ~~>[RC](f: (C, D, E, F, G) ⇒ RC): ReductionRule2_3[Y, Z, A, B, RC]

  63. def ~~>[RB](f: (B, C, D, E, F, G) ⇒ RB): ReductionRule2_2[Y, Z, A, RB]

  64. def ~~>[RA](f: (A, B, C, D, E, F, G) ⇒ RA): ReductionRule2[Y, Z, RA]

  65. def ~~?(f: (G) ⇒ Boolean): ReductionRule2_6[Y, Z, A, B, C, D, E, F]

  66. def ~~?(f: (F, G) ⇒ Boolean): ReductionRule2_5[Y, Z, A, B, C, D, E]

  67. def ~~?(f: (E, F, G) ⇒ Boolean): ReductionRule2_4[Y, Z, A, B, C, D]

  68. def ~~?(f: (D, E, F, G) ⇒ Boolean): ReductionRule2_3[Y, Z, A, B, C]

  69. def ~~?(f: (C, D, E, F, G) ⇒ Boolean): ReductionRule2_2[Y, Z, A, B]

  70. def ~~?(f: (B, C, D, E, F, G) ⇒ Boolean): ReductionRule2[Y, Z, A]

  71. def ~~?(f: (A, B, C, D, E, F, G) ⇒ Boolean): PopRule2[Y, Z]

  72. def ~~~%(f: (G) ⇒ Unit): ReductionRule2_7[Y, Z, A, B, C, D, E, F, G]

  73. def ~~~%(f: (F, G) ⇒ Unit): ReductionRule2_7[Y, Z, A, B, C, D, E, F, G]

  74. def ~~~%(f: (E, F, G) ⇒ Unit): ReductionRule2_7[Y, Z, A, B, C, D, E, F, G]

  75. def ~~~%(f: (D, E, F, G) ⇒ Unit): ReductionRule2_7[Y, Z, A, B, C, D, E, F, G]

  76. def ~~~%(f: (C, D, E, F, G) ⇒ Unit): ReductionRule2_7[Y, Z, A, B, C, D, E, F, G]

  77. def ~~~%(f: (B, C, D, E, F, G) ⇒ Unit): ReductionRule2_7[Y, Z, A, B, C, D, E, F, G]

  78. def ~~~%(f: (A, B, C, D, E, F, G) ⇒ Unit): ReductionRule2_7[Y, Z, A, B, C, D, E, F, G]

  79. def ~~~?(f: (G) ⇒ Boolean): ReductionRule2_7[Y, Z, A, B, C, D, E, F, G]

  80. def ~~~?(f: (F, G) ⇒ Boolean): ReductionRule2_7[Y, Z, A, B, C, D, E, F, G]

  81. def ~~~?(f: (E, F, G) ⇒ Boolean): ReductionRule2_7[Y, Z, A, B, C, D, E, F, G]

  82. def ~~~?(f: (D, E, F, G) ⇒ Boolean): ReductionRule2_7[Y, Z, A, B, C, D, E, F, G]

  83. def ~~~?(f: (C, D, E, F, G) ⇒ Boolean): ReductionRule2_7[Y, Z, A, B, C, D, E, F, G]

  84. def ~~~?(f: (B, C, D, E, F, G) ⇒ Boolean): ReductionRule2_7[Y, Z, A, B, C, D, E, F, G]

  85. def ~~~?(f: (A, B, C, D, E, F, G) ⇒ Boolean): ReductionRule2_7[Y, Z, A, B, C, D, E, F, G]

Inherited from ReductionRule

Inherited from Rule

Inherited from AnyRef

Inherited from Any

Ungrouped