ReductionRule2

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

    

    Definition Classes

    Rule

19. val matcher: Matcher

    

    Definition Classes

    ReductionRule2 → Rule

20. def memoMismatches: ReductionRule2.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: ReductionRule2.this.type

    

    Definition Classes

    Rule

25. def suppressNode: ReductionRule2.this.type

    

    Definition Classes

    Rule

26. def suppressSubnodes: ReductionRule2.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): ReductionRule2.this.type

    

    Attributes

    protected

    Definition Classes

    ReductionRule2 → Rule

34. def |[YY <: Y, ZZ <: Z, AA >: A](other: ReductionRule2[YY, ZZ, AA]): ReductionRule2[YY, ZZ, AA]

    

35. def ~[B, C, D, E, F, G](other: Rule6[B, C, D, E, F, G]): ReductionRule2_7[Y, Z, A, B, C, D, E, F, G]

    

36. def ~[B, C, D, E, F](other: Rule5[B, C, D, E, F]): ReductionRule2_6[Y, Z, A, B, C, D, E, F]

    

37. def ~[B, C, D, E](other: Rule4[B, C, D, E]): ReductionRule2_5[Y, Z, A, B, C, D, E]

    

38. def ~[B, C, D](other: Rule3[B, C, D]): ReductionRule2_4[Y, Z, A, B, C, D]

    

39. def ~[B, C](other: Rule2[B, C]): ReductionRule2_3[Y, Z, A, B, C]

    

40. def ~[B](other: Rule1[B]): ReductionRule2_2[Y, 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]): ReductionRule2_7[Y, 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]): ReductionRule2_6[Y, 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]): ReductionRule2_5[Y, Z, RA, B, C, D, E]

    

44. def ~[AA >: A, RA, B, C, D](other: ReductionRule1_4[AA, RA, B, C, D]): ReductionRule2_4[Y, Z, RA, B, C, D]

    

45. def ~[AA >: A, RA, B, C](other: ReductionRule1_3[AA, RA, B, C]): ReductionRule2_3[Y, Z, RA, B, C]

    

46. def ~[AA >: A, RA, B](other: ReductionRule1_2[AA, RA, B]): ReductionRule2_2[Y, Z, RA, B]

    

47. def ~[AA >: A, RA](other: ReductionRule1[AA, RA]): ReductionRule2[Y, Z, RA]

    

48. def ~[X, AA >: A, RA, B, C, D, E, F, G](other: ReductionRule2_7[X, AA, RA, B, C, D, E, F, G]): ReductionRule3_7[X, Y, Z, RA, B, C, D, E, F, G]

    

49. def ~[X, AA >: A, RA, B, C, D, E, F](other: ReductionRule2_6[X, AA, RA, B, C, D, E, F]): ReductionRule3_6[X, Y, Z, RA, B, C, D, E, F]

    

50. def ~[X, AA >: A, RA, B, C, D, E](other: ReductionRule2_5[X, AA, RA, B, C, D, E]): ReductionRule3_5[X, Y, Z, RA, B, C, D, E]

    

51. def ~[X, AA >: A, RA, B, C, D](other: ReductionRule2_4[X, AA, RA, B, C, D]): ReductionRule3_4[X, Y, Z, RA, B, C, D]

    

52. def ~[X, AA >: A, RA, B, C](other: ReductionRule2_3[X, AA, RA, B, C]): ReductionRule3_3[X, Y, Z, RA, B, C]

    

53. def ~[X, AA >: A, RA, B](other: ReductionRule2_2[X, AA, RA, B]): ReductionRule3_2[X, Y, Z, RA, B]

    

54. def ~[X, AA >: A, RA](other: ReductionRule2[X, AA, RA]): ReductionRule3[X, Y, Z, RA]

    

55. def ~[AA >: A](other: PopRule1[AA]): PopRule2[Y, Z]

    

56. def ~[X, AA >: A](other: PopRule2[X, AA]): PopRule3[X, Y, Z]

    

57. def ~(other: Rule0): ReductionRule2.this.type

    

    Connects two rules into a rule a sequence.

    Connects two rules into a rule a sequence.

    Definition Classes

    Rule

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

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

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

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

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

    

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

    

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

    

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

    

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

    

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

    

68. def ~~~%(f: (A) ⇒ Unit): ReductionRule2[Y, Z, A]

    

69. def ~~~?(f: (A) ⇒ Boolean): ReductionRule2[Y, Z, A]