ReductionRule1_2

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): ReductionRule1_2.this.type

    Definition Classes

    Rule

21. val matcher: Matcher

    Definition Classes

    ReductionRule1_2 → Rule

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

    Definition Classes

    Rule

27. def suppressNode: ReductionRule1_2.this.type

    Definition Classes

    Rule

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

    Attributes

    protected

    Definition Classes

    ReductionRule1_2 → Rule

36. def |[ZZ <: Z, AA >: A, BB >: B](other: ReductionRule1_2[ZZ, AA, BB]): ReductionRule1_2[ZZ, AA, BB]

37. def ~[C, D, E, F, G](other: Rule5[C, D, E, F, G]): ReductionRule1_7[Z, A, B, C, D, E, F, G]

38. def ~[C, D, E, F](other: Rule4[C, D, E, F]): ReductionRule1_6[Z, A, B, C, D, E, F]

39. def ~[C, D, E](other: Rule3[C, D, E]): ReductionRule1_5[Z, A, B, C, D, E]

40. def ~[C, D](other: Rule2[C, D]): ReductionRule1_4[Z, A, B, C, D]

41. def ~[C](other: Rule1[C]): ReductionRule1_3[Z, A, B, C]

42. 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]

43. 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]

44. def ~[BB >: B, RB, C, D, E](other: ReductionRule1_4[BB, RB, C, D, E]): ReductionRule1_5[Z, A, RB, C, D, E]

45. def ~[BB >: B, RB, C, D](other: ReductionRule1_3[BB, RB, C, D]): ReductionRule1_4[Z, A, RB, C, D]

46. def ~[BB >: B, RB, C](other: ReductionRule1_2[BB, RB, C]): ReductionRule1_3[Z, A, RB, C]

47. def ~[BB >: B, RB](other: ReductionRule1[BB, RB]): ReductionRule1_2[Z, A, RB]

48. 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]

49. 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]

50. 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]

51. 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]

52. def ~[AA >: A, BB >: B, RA, RB, C](other: ReductionRule2_3[AA, BB, RA, RB, C]): ReductionRule1_3[Z, RA, RB, C]

53. def ~[AA >: A, BB >: B, RA, RB](other: ReductionRule2_2[AA, BB, RA, RB]): ReductionRule1_2[Z, RA, RB]

54. def ~[AA >: A, BB >: B, RA](other: ReductionRule2[AA, BB, RA]): ReductionRule1[Z, RA]

55. 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]

56. 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]

57. 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]

58. 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]

59. 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]

60. def ~[Y, AA >: A, BB >: B, RA, RB](other: ReductionRule3_2[Y, AA, BB, RA, RB]): ReductionRule2_2[Y, Z, RA, RB]

61. def ~[Y, AA >: A, BB >: B, RA](other: ReductionRule3[Y, AA, BB, RA]): ReductionRule2[Y, Z, RA]

62. def ~[BB >: B](other: PopRule1[BB]): ReductionRule1[Z, A]

63. def ~[AA >: A, BB >: B](other: PopRule2[AA, BB]): PopRule1[Z]

64. def ~[Y, AA >: A, BB >: B](other: PopRule3[Y, AA, BB]): PopRule2[Y, Z]

65. 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

66. 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

67. 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

68. 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

69. 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

70. def ~~%[Y](f: (B) ⇒ Unit): ReductionRule1[Z, A]

71. def ~~%[Y](f: (A, B) ⇒ Unit): PopRule1[Z]

72. def ~~%[Y](f: (Y, A, B) ⇒ Unit): PopRule2[Y, Z]

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

74. def ~~>[RB](f: (B) ⇒ RB): ReductionRule1_2[Z, A, RB]

75. def ~~>[RA](f: (A, B) ⇒ RA): ReductionRule1[Z, RA]

76. def ~~>[Y, RA](f: (Y, A, B) ⇒ RA): ReductionRule2[Y, Z, RA]

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

78. def ~~?(f: (B) ⇒ Boolean): ReductionRule1[Z, A]

79. def ~~?(f: (A, B) ⇒ Boolean): PopRule1[Z]

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

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

82. def ~~~%(f: (B) ⇒ Unit): ReductionRule1_2[Z, A, B]

83. def ~~~%(f: (A, B) ⇒ Unit): ReductionRule1_2[Z, A, B]

84. def ~~~?(f: (B) ⇒ Boolean): ReductionRule1_2[Z, A, B]

85. def ~~~?(f: (A, B) ⇒ Boolean): ReductionRule1_2[Z, A, B]