ReductionRule1_5

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

    @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

16. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

17. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

18. def label(label: String): ReductionRule1_5.this.type

    

    Definition Classes

    Rule

19. val matcher: Matcher

    

    Definition Classes

    ReductionRule1_5 → Rule

20. def memoMismatches: ReductionRule1_5.this.type

    

    Definition Classes

    Rule

21. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

22. final def notify(): Unit

    

    Definition Classes

    AnyRef

23. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

24. def skipNode: ReductionRule1_5.this.type

    

    Definition Classes

    Rule

25. def suppressNode: ReductionRule1_5.this.type

    

    Definition Classes

    Rule

26. def suppressSubnodes: ReductionRule1_5.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

    @throws( ... )

33. def withMatcher(matcher: Matcher): ReductionRule1_5.this.type

    

    Attributes

    protected

    Definition Classes

    ReductionRule1_5 → Rule

34. def |[ZZ <: Z, AA >: A, BB >: B, CC >: C, DD >: D, EE >: E](other: ReductionRule1_5[ZZ, AA, BB, CC, DD, EE]): ReductionRule1_5[ZZ, AA, BB, CC, DD, EE]

    

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

    

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

    

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

    

38. def ~[EE >: E, RE, F](other: ReductionRule1_2[EE, RE, F]): ReductionRule1_6[Z, A, B, C, D, RE, F]

    

39. def ~[EE >: E, RE](other: ReductionRule1[EE, RE]): ReductionRule1_5[Z, A, B, C, D, RE]

    

40. def ~[DD >: D, EE >: E, RD, RE, F, G](other: ReductionRule2_4[DD, EE, RD, RE, F, G]): ReductionRule1_7[Z, A, B, C, RD, RE, F, G]

    

41. def ~[DD >: D, EE >: E, RD, RE, F](other: ReductionRule2_3[DD, EE, RD, RE, F]): ReductionRule1_6[Z, A, B, C, RD, RE, F]

    

42. def ~[DD >: D, EE >: E, RD, RE](other: ReductionRule2_2[DD, EE, RD, RE]): ReductionRule1_5[Z, A, B, C, RD, RE]

    

43. def ~[DD >: D, EE >: E, RD](other: ReductionRule2[DD, EE, RD]): ReductionRule1_4[Z, A, B, C, RD]

    

44. def ~[CC >: C, DD >: D, EE >: E, RC, RD, RE, RF, G](other: ReductionRule3_5[CC, DD, EE, RC, RD, RE, RF, G]): ReductionRule1_7[Z, A, B, RC, RD, RE, RF, G]

    

45. def ~[CC >: C, DD >: D, EE >: E, RC, RD, RE, RF](other: ReductionRule3_4[CC, DD, EE, RC, RD, RE, RF]): ReductionRule1_6[Z, A, B, RC, RD, RE, RF]

    

46. def ~[CC >: C, DD >: D, EE >: E, RC, RD, RE](other: ReductionRule3_3[CC, DD, EE, RC, RD, RE]): ReductionRule1_5[Z, A, B, RC, RD, RE]

    

47. def ~[CC >: C, DD >: D, EE >: E, RC, RD](other: ReductionRule3_2[CC, DD, EE, RC, RD]): ReductionRule1_4[Z, A, B, RC, RD]

    

48. def ~[CC >: C, DD >: D, EE >: E, RC](other: ReductionRule3[CC, DD, EE, RC]): ReductionRule1_3[Z, A, B, RC]

    

49. def ~[EE >: E](other: PopRule1[EE]): ReductionRule1_4[Z, A, B, C, D]

    

50. def ~[DD >: D, EE >: E](other: PopRule2[DD, EE]): ReductionRule1_3[Z, A, B, C]

    

51. def ~[CC >: C, DD >: D, EE >: E](other: PopRule3[CC, DD, EE]): ReductionRule1_2[Z, A, B]

    

52. def ~(other: Rule0): ReductionRule1_5.this.type

    

    Connects two rules into a rule a sequence.

    Connects two rules into a rule a sequence.

    Definition Classes

    Rule

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

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

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

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

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

    

58. def ~~%(f: (D, E) ⇒ Unit): ReductionRule1_3[Z, A, B, C]

    

59. def ~~%(f: (C, D, E) ⇒ Unit): ReductionRule1_2[Z, A, B]

    

60. def ~~%(f: (B, C, D, E) ⇒ Unit): ReductionRule1[Z, A]

    

61. def ~~%(f: (A, B, C, D, E) ⇒ Unit): PopRule1[Z]

    

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

    

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

    

64. def ~~>[RE](f: (E) ⇒ RE): ReductionRule1_5[Z, A, B, C, D, RE]

    

65. def ~~>[RD](f: (D, E) ⇒ RD): ReductionRule1_4[Z, A, B, C, RD]

    

66. def ~~>[RC](f: (C, D, E) ⇒ RC): ReductionRule1_3[Z, A, B, RC]

    

67. def ~~>[RB](f: (B, C, D, E) ⇒ RB): ReductionRule1_2[Z, A, RB]

    

68. def ~~>[RA](f: (A, B, C, D, E) ⇒ RA): ReductionRule1[Z, RA]

    

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

    

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

    

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

    

72. def ~~?(f: (D, E) ⇒ Boolean): ReductionRule1_3[Z, A, B, C]

    

73. def ~~?(f: (C, D, E) ⇒ Boolean): ReductionRule1_2[Z, A, B]

    

74. def ~~?(f: (B, C, D, E) ⇒ Boolean): ReductionRule1[Z, A]

    

75. def ~~?(f: (A, B, C, D, E) ⇒ Boolean): PopRule1[Z]

    

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

    

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

    

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

    

79. def ~~~%(f: (D, E) ⇒ Unit): ReductionRule1_5[Z, A, B, C, D, E]

    

80. def ~~~%(f: (C, D, E) ⇒ Unit): ReductionRule1_5[Z, A, B, C, D, E]

    

81. def ~~~%(f: (B, C, D, E) ⇒ Unit): ReductionRule1_5[Z, A, B, C, D, E]

    

82. def ~~~%(f: (A, B, C, D, E) ⇒ Unit): ReductionRule1_5[Z, A, B, C, D, E]

    

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

    

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

    

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

    

86. def ~~~?(f: (B, C, D, E) ⇒ Boolean): ReductionRule1_5[Z, A, B, C, D, E]

    

87. def ~~~?(f: (A, B, C, D, E) ⇒ Boolean): ReductionRule1_5[Z, A, B, C, D, E]