c

org.parboiled.scala.rules

ReductionRule1

class ReductionRule1[-Z, +A] extends ReductionRule

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

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

Instance Constructors

  1. new ReductionRule1(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[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  12. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  13. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  14. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  15. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  16. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  17. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  18. def label(label: String): ReductionRule1.this.type
    Definition Classes
    Rule
  19. val matcher: Matcher
    Definition Classes
    ReductionRule1 → Rule
  20. def memoMismatches: ReductionRule1.this.type
    Definition Classes
    Rule
  21. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  22. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  23. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  24. def skipNode: ReductionRule1.this.type
    Definition Classes
    Rule
  25. def suppressNode: ReductionRule1.this.type
    Definition Classes
    Rule
  26. def suppressSubnodes: ReductionRule1.this.type
    Definition Classes
    Rule
  27. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  28. def toString(): String
    Definition Classes
    Rule → AnyRef → Any
  29. 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
  30. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  31. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  32. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  33. def withMatcher(matcher: Matcher): ReductionRule1.this.type
    Attributes
    protected
    Definition Classes
    ReductionRule1 → Rule
  34. def |[ZZ <: Z, AA >: A](other: ReductionRule1[ZZ, AA]): ReductionRule1[ZZ, AA]
  35. def ~[B, C, D, E, F, G](other: Rule6[B, C, D, E, F, G]): ReductionRule1_7[Z, A, B, C, D, E, F, G]
  36. def ~[B, C, D, E, F](other: Rule5[B, C, D, E, F]): ReductionRule1_6[Z, A, B, C, D, E, F]
  37. def ~[B, C, D, E](other: Rule4[B, C, D, E]): ReductionRule1_5[Z, A, B, C, D, E]
  38. def ~[B, C, D](other: Rule3[B, C, D]): ReductionRule1_4[Z, A, B, C, D]
  39. def ~[B, C](other: Rule2[B, C]): ReductionRule1_3[Z, A, B, C]
  40. def ~[B](other: Rule1[B]): ReductionRule1_2[Z, A, B]
  41. def ~[AA >: A, RA, B, C, D, E, F, G](other: ReductionRule1_7[AA, RA, B, C, D, E, F, G]): ReductionRule1_7[Z, RA, B, C, D, E, F, G]
  42. def ~[AA >: A, RA, B, C, D, E, F](other: ReductionRule1_6[AA, RA, B, C, D, E, F]): ReductionRule1_6[Z, RA, B, C, D, E, F]
  43. def ~[AA >: A, RA, B, C, D, E](other: ReductionRule1_5[AA, RA, B, C, D, E]): ReductionRule1_5[Z, RA, B, C, D, E]
  44. def ~[AA >: A, RA, B, C, D](other: ReductionRule1_4[AA, RA, B, C, D]): ReductionRule1_4[Z, RA, B, C, D]
  45. def ~[AA >: A, RA, B, C](other: ReductionRule1_3[AA, RA, B, C]): ReductionRule1_3[Z, RA, B, C]
  46. def ~[AA >: A, RA, B](other: ReductionRule1_2[AA, RA, B]): ReductionRule1_2[Z, RA, B]
  47. def ~[AA >: A, RA](other: ReductionRule1[AA, RA]): ReductionRule1[Z, RA]
  48. def ~[Y, AA >: A, RA, B, C, D, E, F, G](other: ReductionRule2_7[Y, AA, RA, B, C, D, E, F, G]): ReductionRule2_7[Y, Z, RA, B, C, D, E, F, G]
  49. def ~[Y, AA >: A, RA, B, C, D, E, F](other: ReductionRule2_6[Y, AA, RA, B, C, D, E, F]): ReductionRule2_6[Y, Z, RA, B, C, D, E, F]
  50. def ~[Y, AA >: A, RA, B, C, D, E](other: ReductionRule2_5[Y, AA, RA, B, C, D, E]): ReductionRule2_5[Y, Z, RA, B, C, D, E]
  51. def ~[Y, AA >: A, RA, B, C, D](other: ReductionRule2_4[Y, AA, RA, B, C, D]): ReductionRule2_4[Y, Z, RA, B, C, D]
  52. def ~[Y, AA >: A, RA, B, C](other: ReductionRule2_3[Y, AA, RA, B, C]): ReductionRule2_3[Y, Z, RA, B, C]
  53. def ~[Y, AA >: A, RA, B](other: ReductionRule2_2[Y, AA, RA, B]): ReductionRule2_2[Y, Z, RA, B]
  54. def ~[Y, AA >: A, RA](other: ReductionRule2[Y, AA, RA]): ReductionRule2[Y, Z, RA]
  55. def ~[X, Y, AA >: A, RA, B, C, D, E, F, G](other: ReductionRule3_7[X, Y, AA, RA, B, C, D, E, F, G]): ReductionRule3_7[X, Y, Z, RA, B, C, D, E, F, G]
  56. def ~[X, Y, AA >: A, RA, B, C, D, E, F](other: ReductionRule3_6[X, Y, AA, RA, B, C, D, E, F]): ReductionRule3_6[X, Y, Z, RA, B, C, D, E, F]
  57. def ~[X, Y, AA >: A, RA, B, C, D, E](other: ReductionRule3_5[X, Y, AA, RA, B, C, D, E]): ReductionRule3_5[X, Y, Z, RA, B, C, D, E]
  58. def ~[X, Y, AA >: A, RA, B, C, D](other: ReductionRule3_4[X, Y, AA, RA, B, C, D]): ReductionRule3_4[X, Y, Z, RA, B, C, D]
  59. def ~[X, Y, AA >: A, RA, B, C](other: ReductionRule3_3[X, Y, AA, RA, B, C]): ReductionRule3_3[X, Y, Z, RA, B, C]
  60. def ~[X, Y, AA >: A, RA, B](other: ReductionRule3_2[X, Y, AA, RA, B]): ReductionRule3_2[X, Y, Z, RA, B]
  61. def ~[X, Y, AA >: A, RA](other: ReductionRule3[X, Y, AA, RA]): ReductionRule3[X, Y, Z, RA]
  62. def ~[AA >: A](other: PopRule1[AA]): PopRule1[Z]
  63. def ~[Y, AA >: A](other: PopRule2[Y, AA]): PopRule2[Y, Z]
  64. def ~[X, Y, AA >: A](other: PopRule3[X, Y, AA]): PopRule3[X, Y, Z]
  65. def ~(other: Rule0): ReductionRule1.this.type

    Connects two rules into a rule a sequence.

    Connects two rules into a rule a sequence.

    Definition Classes
    Rule
  66. def ~%(f: (String) ⇒ Unit): ReductionRule1.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
  67. def ~:%(f: (Char) ⇒ Unit): ReductionRule1.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
  68. def ~:?(f: (Char) ⇒ Boolean): ReductionRule1.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
  69. def ~?(f: (String) ⇒ Boolean): ReductionRule1.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
  70. def ~~%(f: (A) ⇒ Unit): PopRule1[Z]
  71. def ~~%[Y](f: (Y, A) ⇒ Unit): PopRule2[Y, Z]
  72. def ~~%[X, Y](f: (X, Y, A) ⇒ Unit): PopRule3[X, Y, Z]
  73. def ~~>[RA](f: (A) ⇒ RA): ReductionRule1[Z, RA]
  74. def ~~>[Y, RA](f: (Y, A) ⇒ RA): ReductionRule2[Y, Z, RA]
  75. def ~~>[X, Y, RA](f: (X, Y, A) ⇒ RA): ReductionRule3[X, Y, Z, RA]
  76. def ~~?(f: (A) ⇒ Boolean): PopRule1[Z]
  77. def ~~?[Y](f: (Y, A) ⇒ Boolean): PopRule2[Y, Z]
  78. def ~~?[X, Y](f: (X, Y, A) ⇒ Boolean): PopRule3[X, Y, Z]
  79. def ~~~%(f: (A) ⇒ Unit): ReductionRule1[Z, A]
  80. def ~~~?(f: (A) ⇒ Boolean): ReductionRule1[Z, A]

Inherited from ReductionRule

Inherited from Rule

Inherited from AnyRef

Inherited from Any

Ungrouped