c

org.parboiled.scala.rules

ReductionRule1_2

class ReductionRule1_2[-Z, +A, +B] extends ReductionRule

A rule taking one value off the value stack and replacing it with two values.

Linear Supertypes
ReductionRule, Rule, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ReductionRule1_2
  2. ReductionRule
  3. Rule
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new ReductionRule1_2(matcher: Matcher)

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def append(other: Matcher): Matcher
    Attributes
    protected
    Definition Classes
    Rule
  5. def append(other: Rule): Matcher
    Attributes
    protected
    Definition Classes
    Rule
  6. def append(f: (Context[Any]) => Boolean): Matcher
    Attributes
    protected
    Definition Classes
    Rule
  7. def append(action: Action[_]): Matcher
    Attributes
    protected
    Definition Classes
    Rule
  8. def appendChoice(other: Matcher): Matcher
    Attributes
    protected
    Definition Classes
    Rule
  9. def appendChoice(other: Rule): Matcher
    Attributes
    protected
    Definition Classes
    Rule
  10. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  11. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @IntrinsicCandidate() @native()
  12. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  13. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  14. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @IntrinsicCandidate() @native()
  15. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @IntrinsicCandidate() @native()
  16. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  17. def label(label: String): ReductionRule1_2.this.type
    Definition Classes
    Rule
  18. val matcher: Matcher
    Definition Classes
    ReductionRule1_2Rule
  19. def memoMismatches: ReductionRule1_2.this.type
    Definition Classes
    Rule
  20. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  21. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @IntrinsicCandidate() @native()
  22. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @IntrinsicCandidate() @native()
  23. def skipNode: ReductionRule1_2.this.type
    Definition Classes
    Rule
  24. def suppressNode: ReductionRule1_2.this.type
    Definition Classes
    Rule
  25. def suppressSubnodes: ReductionRule1_2.this.type
    Definition Classes
    Rule
  26. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  27. def toString(): String
    Definition Classes
    Rule → AnyRef → Any
  28. 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
  29. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  30. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  31. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  32. def withMatcher(matcher: Matcher): ReductionRule1_2.this.type
    Attributes
    protected
    Definition Classes
    ReductionRule1_2Rule
  33. def |[ZZ <: Z, AA >: A, BB >: B](other: ReductionRule1_2[ZZ, AA, BB]): ReductionRule1_2[ZZ, AA, BB]
  34. def ~[C, D, E, F, G](other: Rule5[C, D, E, F, G]): ReductionRule1_7[Z, A, B, C, D, E, F, G]
  35. def ~[C, D, E, F](other: Rule4[C, D, E, F]): ReductionRule1_6[Z, A, B, C, D, E, F]
  36. def ~[C, D, E](other: Rule3[C, D, E]): ReductionRule1_5[Z, A, B, C, D, E]
  37. def ~[C, D](other: Rule2[C, D]): ReductionRule1_4[Z, A, B, C, D]
  38. def ~[C](other: Rule1[C]): ReductionRule1_3[Z, A, B, C]
  39. def ~[BB >: B, RB, C, D, E, F, G](other: ReductionRule1_6[BB, RB, C, D, E, F, G]): ReductionRule1_7[Z, A, RB, C, D, E, F, G]
  40. def ~[BB >: B, RB, C, D, E, F](other: ReductionRule1_5[BB, RB, C, D, E, F]): ReductionRule1_6[Z, A, RB, C, D, E, F]
  41. def ~[BB >: B, RB, C, D, E](other: ReductionRule1_4[BB, RB, C, D, E]): ReductionRule1_5[Z, A, RB, C, D, E]
  42. def ~[BB >: B, RB, C, D](other: ReductionRule1_3[BB, RB, C, D]): ReductionRule1_4[Z, A, RB, C, D]
  43. def ~[BB >: B, RB, C](other: ReductionRule1_2[BB, RB, C]): ReductionRule1_3[Z, A, RB, C]
  44. def ~[BB >: B, RB](other: ReductionRule1[BB, RB]): ReductionRule1_2[Z, A, RB]
  45. def ~[AA >: A, BB >: B, RA, RB, C, D, E, F, G](other: ReductionRule2_7[AA, BB, RA, RB, C, D, E, F, G]): ReductionRule1_7[Z, RA, RB, C, D, E, F, G]
  46. def ~[AA >: A, BB >: B, RA, RB, C, D, E, F](other: ReductionRule2_6[AA, BB, RA, RB, C, D, E, F]): ReductionRule1_6[Z, RA, RB, C, D, E, F]
  47. def ~[AA >: A, BB >: B, RA, RB, C, D, E](other: ReductionRule2_5[AA, BB, RA, RB, C, D, E]): ReductionRule1_5[Z, RA, RB, C, D, E]
  48. def ~[AA >: A, BB >: B, RA, RB, C, D](other: ReductionRule2_4[AA, BB, RA, RB, C, D]): ReductionRule1_4[Z, RA, RB, C, D]
  49. def ~[AA >: A, BB >: B, RA, RB, C](other: ReductionRule2_3[AA, BB, RA, RB, C]): ReductionRule1_3[Z, RA, RB, C]
  50. def ~[AA >: A, BB >: B, RA, RB](other: ReductionRule2_2[AA, BB, RA, RB]): ReductionRule1_2[Z, RA, RB]
  51. def ~[AA >: A, BB >: B, RA](other: ReductionRule2[AA, BB, RA]): ReductionRule1[Z, RA]
  52. def ~[Y, AA >: A, BB >: B, RA, RB, C, D, E, F, G](other: ReductionRule3_7[Y, AA, BB, RA, RB, C, D, E, F, G]): ReductionRule2_7[Y, Z, RA, RB, C, D, E, F, G]
  53. def ~[Y, AA >: A, BB >: B, RA, RB, C, D, E, F](other: ReductionRule3_6[Y, AA, BB, RA, RB, C, D, E, F]): ReductionRule2_6[Y, Z, RA, RB, C, D, E, F]
  54. def ~[Y, AA >: A, BB >: B, RA, RB, C, D, E](other: ReductionRule3_5[Y, AA, BB, RA, RB, C, D, E]): ReductionRule2_5[Y, Z, RA, RB, C, D, E]
  55. def ~[Y, AA >: A, BB >: B, RA, RB, C, D](other: ReductionRule3_4[Y, AA, BB, RA, RB, C, D]): ReductionRule2_4[Y, Z, RA, RB, C, D]
  56. def ~[Y, AA >: A, BB >: B, RA, RB, C](other: ReductionRule3_3[Y, AA, BB, RA, RB, C]): ReductionRule2_3[Y, Z, RA, RB, C]
  57. def ~[Y, AA >: A, BB >: B, RA, RB](other: ReductionRule3_2[Y, AA, BB, RA, RB]): ReductionRule2_2[Y, Z, RA, RB]
  58. def ~[Y, AA >: A, BB >: B, RA](other: ReductionRule3[Y, AA, BB, RA]): ReductionRule2[Y, Z, RA]
  59. def ~[BB >: B](other: PopRule1[BB]): ReductionRule1[Z, A]
  60. def ~[AA >: A, BB >: B](other: PopRule2[AA, BB]): PopRule1[Z]
  61. def ~[Y, AA >: A, BB >: B](other: PopRule3[Y, AA, BB]): PopRule2[Y, Z]
  62. def ~(other: Rule0): ReductionRule1_2.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): ReductionRule1_2.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): ReductionRule1_2.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): ReductionRule1_2.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): ReductionRule1_2.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 ~~%[Y](f: (B) => Unit): ReductionRule1[Z, A]
  68. def ~~%[Y](f: (A, B) => Unit): PopRule1[Z]
  69. def ~~%[Y](f: (Y, A, B) => Unit): PopRule2[Y, Z]
  70. def ~~%[X, Y](f: (X, Y, A, B) => Unit): PopRule3[X, Y, Z]
  71. def ~~>[RB](f: (B) => RB): ReductionRule1_2[Z, A, RB]
  72. def ~~>[RA](f: (A, B) => RA): ReductionRule1[Z, RA]
  73. def ~~>[Y, RA](f: (Y, A, B) => RA): ReductionRule2[Y, Z, RA]
  74. def ~~>[X, Y, RA](f: (X, Y, A, B) => RA): ReductionRule3[X, Y, Z, RA]
  75. def ~~?(f: (B) => Boolean): ReductionRule1[Z, A]
  76. def ~~?(f: (A, B) => Boolean): PopRule1[Z]
  77. def ~~?[Y](f: (Y, A, B) => Boolean): PopRule2[Y, Z]
  78. def ~~?[X, Y](f: (X, Y, A, B) => Boolean): PopRule3[X, Y, Z]
  79. def ~~~%(f: (B) => Unit): ReductionRule1_2[Z, A, B]
  80. def ~~~%(f: (A, B) => Unit): ReductionRule1_2[Z, A, B]
  81. def ~~~?(f: (B) => Boolean): ReductionRule1_2[Z, A, B]
  82. def ~~~?(f: (A, B) => Boolean): ReductionRule1_2[Z, A, B]

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated

    (Since version 9)

Inherited from ReductionRule

Inherited from Rule

Inherited from AnyRef

Inherited from Any

Ungrouped