org.parboiled.scala.rules

Rule1

class Rule1[+A] extends PushRule

A rule pushing one new value of a given type onto the parsers value stack.

Linear Supertypes
PushRule, Rule, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Rule1
  2. PushRule
  3. Rule
  4. AnyRef
  5. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Rule1(matcher: Matcher)

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

    Definition Classes
    Rule
  21. val matcher: Matcher

    Definition Classes
    Rule1Rule
  22. def memoMismatches: Rule1.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: Rule1.this.type

    Definition Classes
    Rule
  27. def suppressNode: Rule1.this.type

    Definition Classes
    Rule
  28. def suppressSubnodes: Rule1.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): Rule1.this.type

    Attributes
    protected
    Definition Classes
    Rule1Rule
  36. def |[AA >: A](other: Rule1[AA]): Rule1[AA]

  37. def ~[B, C, D, E, F, G](other: Rule6[B, C, D, E, F, G]): Rule7[A, B, C, D, E, F, G]

  38. def ~[B, C, D, E, F](other: Rule5[B, C, D, E, F]): Rule6[A, B, C, D, E, F]

  39. def ~[B, C, D, E](other: Rule4[B, C, D, E]): Rule5[A, B, C, D, E]

  40. def ~[B, C, D](other: Rule3[B, C, D]): Rule4[A, B, C, D]

  41. def ~[B, C](other: Rule2[B, C]): Rule3[A, B, C]

  42. def ~[B](other: Rule1[B]): Rule2[A, B]

  43. def ~[AA >: A, R](other: ReductionRule1[AA, R]): Rule1[R]

  44. def ~[Y, AA >: A, R](other: ReductionRule2[Y, AA, R]): ReductionRule1[Y, R]

  45. def ~[X, Y, AA >: A, R](other: ReductionRule3[X, Y, AA, R]): ReductionRule2[X, Y, R]

  46. def ~[AA >: A](other: PopRule1[AA]): Rule0

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

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

  49. def ~(other: Rule0): Rule1.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): Rule1.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): Rule1.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): Rule2[A, R]

  53. def ~:?(f: (Char) ⇒ Boolean): Rule1.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): Rule2[A, R]

  55. def ~>>[R](f: (IndexRange) ⇒ R): Rule2[A, R]

  56. def ~?(f: (String) ⇒ Boolean): Rule1.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, A) ⇒ Unit): PopRule3[X, Y, Z]

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

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

  60. def ~~%(f: (A) ⇒ Unit): Rule0

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

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

  63. def ~~>[Z, R](f: (Z, A) ⇒ R): ReductionRule1[Z, R]

  64. def ~~>[R](f: (A) ⇒ R): Rule1[R]

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

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

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

  68. def ~~?(f: (A) ⇒ Boolean): Rule0

  69. def ~~~%(f: (A) ⇒ Unit): Rule1[A]

  70. def ~~~>[R](f: (A) ⇒ R): Rule2[A, R]

  71. def ~~~?(f: (A) ⇒ Boolean): Rule1[A]

Inherited from PushRule

Inherited from Rule

Inherited from AnyRef

Inherited from Any

No Group