class Rule0 extends Rule

A rule which does not affect the parsers value stack.

Linear Supertypes
Rule, AnyRef, Any
Known Subclasses
CharRule
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Rule0
  2. Rule
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Rule0(matcher: Matcher)

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def -(upperBound: String): Rule0
  4. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  5. def append(other: Matcher): Matcher
    Attributes
    protected
    Definition Classes
    Rule
  6. def append(other: Rule): Matcher
    Attributes
    protected
    Definition Classes
    Rule
  7. def append(f: (Context[Any]) ⇒ Boolean): Matcher
    Attributes
    protected
    Definition Classes
    Rule
  8. def append(action: Action[_]): Matcher
    Attributes
    protected
    Definition Classes
    Rule
  9. def appendChoice(other: Matcher): Matcher
    Attributes
    protected
    Definition Classes
    Rule
  10. def appendChoice(other: Rule): Matcher
    Attributes
    protected
    Definition Classes
    Rule
  11. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  12. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  13. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  14. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  15. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  16. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  17. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  18. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  19. def label(label: String): Rule0.this.type
    Definition Classes
    Rule
  20. val matcher: Matcher
    Definition Classes
    Rule0 → Rule
  21. def memoMismatches: Rule0.this.type
    Definition Classes
    Rule
  22. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  23. final def notify(): Unit
    Definition Classes
    AnyRef
  24. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  25. def skipNode: Rule0.this.type
    Definition Classes
    Rule
  26. def suppressNode: Rule0.this.type
    Definition Classes
    Rule
  27. def suppressSubnodes: Rule0.this.type
    Definition Classes
    Rule
  28. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  29. def toString(): String
    Definition Classes
    Rule → AnyRef → Any
  30. 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
  31. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  32. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  33. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  34. def withMatcher(matcher: Matcher): Rule0.this.type
    Attributes
    protected
    Definition Classes
    Rule0 → Rule
  35. def |(other: Rule0): Rule0
  36. def ~[A, B, C, D, E, F, G](other: Rule7[A, B, C, D, E, F, G]): Rule7[A, B, C, D, E, F, G]
  37. def ~[A, B, C, D, E, F](other: Rule6[A, B, C, D, E, F]): Rule6[A, B, C, D, E, F]
  38. def ~[A, B, C, D, E](other: Rule5[A, B, C, D, E]): Rule5[A, B, C, D, E]
  39. def ~[A, B, C, D](other: Rule4[A, B, C, D]): Rule4[A, B, C, D]
  40. def ~[A, B, C](other: Rule3[A, B, C]): Rule3[A, B, C]
  41. def ~[A, B](other: Rule2[A, B]): Rule2[A, B]
  42. def ~[A](other: Rule1[A]): Rule1[A]
  43. def ~[Z, R](other: ReductionRule1[Z, R]): ReductionRule1[Z, R]
  44. def ~[Y, Z, R](other: ReductionRule2[Y, Z, R]): ReductionRule2[Y, Z, R]
  45. def ~[X, Y, Z, R](other: ReductionRule3[X, Y, Z, R]): ReductionRule3[X, Y, Z, R]
  46. def ~[Z](other: PopRule1[Z]): PopRule1[Z]
  47. def ~[Y, Z](other: PopRule2[Y, Z]): PopRule2[Y, Z]
  48. def ~[X, Y, Z](other: PopRule3[X, Y, Z]): PopRule3[X, Y, Z]
  49. def ~(other: Rule0): Rule0.this.type

    Connects two rules into a rule a sequence.

    Connects two rules into a rule a sequence.

    Definition Classes
    Rule
  50. def ~%(f: (String) ⇒ Unit): Rule0.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
  51. def ~:%(f: (Char) ⇒ Unit): Rule0.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
  52. def ~:>[R](f: (Char) ⇒ R): Rule1[R]
  53. def ~:?(f: (Char) ⇒ Boolean): Rule0.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
  54. def ~>[R](f: (String) ⇒ R): Rule1[R]
  55. def ~>>[R](f: (IndexRange) ⇒ R): Rule1[R]
  56. def ~?(f: (String) ⇒ Boolean): Rule0.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 ~~%[X, Y, Z](f: (X, Y, Z) ⇒ Unit): PopRule3[X, Y, Z]
  58. def ~~%[Y, Z](f: (Y, Z) ⇒ Unit): PopRule2[Y, Z]
  59. def ~~%[Z](f: (Z) ⇒ Unit): PopRule1[Z]
  60. def ~~>[X, Y, Z, R](f: (X, Y, Z) ⇒ R): ReductionRule3[X, Y, Z, R]
  61. def ~~>[Y, Z, R](f: (Y, Z) ⇒ R): ReductionRule2[Y, Z, R]
  62. def ~~>[Z, R](f: (Z) ⇒ R): ReductionRule1[Z, R]
  63. def ~~?[X, Y, Z](f: (X, Y, Z) ⇒ Boolean): PopRule3[X, Y, Z]
  64. def ~~?[Y, Z](f: (Y, Z) ⇒ Boolean): PopRule2[Y, Z]
  65. def ~~?[Z](f: (Z) ⇒ Boolean): PopRule1[Any]

Inherited from Rule

Inherited from AnyRef

Inherited from Any

Ungrouped