class Rule5[+A, +B, +C, +D, +E] extends PushRule
A rule pushing 5 new values of given types onto the parsers value stack.
- Alphabetic
- By Inheritance
- Rule5
- PushRule
- Rule
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new Rule5(matcher: Matcher)
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def append(other: Matcher): Matcher
- Attributes
- protected
- Definition Classes
- Rule
- def append(other: Rule): Matcher
- Attributes
- protected
- Definition Classes
- Rule
- def append(f: (Context[Any]) => Boolean): Matcher
- Attributes
- protected
- Definition Classes
- Rule
- def append(action: Action[_]): Matcher
- Attributes
- protected
- Definition Classes
- Rule
- def appendChoice(other: Matcher): Matcher
- Attributes
- protected
- Definition Classes
- Rule
- def appendChoice(other: Rule): Matcher
- Attributes
- protected
- Definition Classes
- Rule
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @IntrinsicCandidate() @native()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @IntrinsicCandidate() @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @IntrinsicCandidate() @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def label(label: String): Rule5.this.type
- Definition Classes
- Rule
- val matcher: Matcher
- def memoMismatches: Rule5.this.type
- Definition Classes
- Rule
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @IntrinsicCandidate() @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @IntrinsicCandidate() @native()
- def skipNode: Rule5.this.type
- Definition Classes
- Rule
- def suppressNode: Rule5.this.type
- Definition Classes
- Rule
- def suppressSubnodes: Rule5.this.type
- Definition Classes
- Rule
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- Rule → AnyRef → Any
- 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
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- def withMatcher(matcher: Matcher): Rule5.this.type
- def |[AA >: A, BB >: B, CC >: C, DD >: D, EE >: E](other: Rule5[AA, BB, CC, DD, EE]): Rule5[AA, BB, CC, DD, EE]
- def ~[F, G](other: Rule2[F, G]): Rule7[A, B, C, D, E, F, G]
- def ~[F](other: Rule1[F]): Rule6[A, B, C, D, E, F]
- def ~[EE >: E, RE, F, G](other: ReductionRule1_3[EE, RE, F, G]): Rule7[A, B, C, D, RE, F, G]
- def ~[EE >: E, RE, F](other: ReductionRule1_2[EE, RE, F]): Rule6[A, B, C, D, RE, F]
- def ~[EE >: E, RE](other: ReductionRule1[EE, RE]): Rule5[A, B, C, D, RE]
- def ~[DD >: D, EE >: E, RD, RE, F, G](other: ReductionRule2_4[DD, EE, RD, RE, F, G]): Rule7[A, B, C, RD, RE, F, G]
- def ~[DD >: D, EE >: E, RD, RE, F](other: ReductionRule2_3[DD, EE, RD, RE, F]): Rule6[A, B, C, RD, RE, F]
- def ~[DD >: D, EE >: E, RD, RE](other: ReductionRule2_2[DD, EE, RD, RE]): Rule5[A, B, C, RD, RE]
- def ~[DD >: D, EE >: E, RD](other: ReductionRule2[DD, EE, RD]): Rule4[A, B, C, RD]
- def ~[CC >: C, DD >: D, EE >: E, RC, RD, RE, F, G](other: ReductionRule3_5[CC, DD, EE, RC, RD, RE, F, G]): Rule7[A, B, RC, RD, RE, F, G]
- def ~[CC >: C, DD >: D, EE >: E, RC, RD, RE, F](other: ReductionRule3_4[CC, DD, EE, RC, RD, RE, F]): Rule6[A, B, RC, RD, RE, F]
- def ~[CC >: C, DD >: D, EE >: E, RC, RD, RE](other: ReductionRule3_3[CC, DD, EE, RC, RD, RE]): Rule5[A, B, RC, RD, RE]
- def ~[CC >: C, DD >: D, EE >: E, RC, RD](other: ReductionRule3_2[CC, DD, EE, RC, RD]): Rule4[A, B, RC, RD]
- def ~[CC >: C, DD >: D, EE >: E, RC](other: ReductionRule3[CC, DD, EE, RC]): Rule3[A, B, RC]
- def ~[EE >: E](other: PopRule1[EE]): Rule4[A, B, C, D]
- def ~[DD >: D, EE >: E](other: PopRule2[DD, EE]): Rule3[A, B, C]
- def ~[CC >: C, DD >: D, EE >: E](other: PopRule3[CC, DD, EE]): Rule2[A, B]
- def ~(other: Rule0): Rule5.this.type
Connects two rules into a rule a sequence.
Connects two rules into a rule a sequence.
- Definition Classes
- Rule
- def ~%(f: (String) => Unit): Rule5.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
- def ~:%(f: (Char) => Unit): Rule5.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
- def ~:>[R](f: (Char) => R): Rule6[A, B, C, D, E, R]
- def ~:?(f: (Char) => Boolean): Rule5.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
- def ~>[R](f: (String) => R): Rule6[A, B, C, D, E, R]
- def ~>>[R](f: (IndexRange) => R): Rule6[A, B, C, D, E, R]
- def ~?(f: (String) => Boolean): Rule5.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
- def ~~%[Y, Z](f: (Y, Z, A, B, C, D, E) => Unit): PopRule2[Y, Z]
- def ~~%[Z](f: (Z, A, B, C, D, E) => Unit): PopRule1[Z]
- def ~~%(f: (A, B, C, D, E) => Unit): Rule0
- def ~~%(f: (B, C, D, E) => Unit): Rule1[A]
- def ~~%(f: (C, D, E) => Unit): Rule2[A, B]
- def ~~%(f: (D, E) => Unit): Rule3[A, B, C]
- def ~~%(f: (E) => Unit): Rule4[A, B, C, D]
- def ~~>[Y, Z, R](f: (Y, Z, A, B, C, D, E) => R): ReductionRule2[Y, Z, R]
- def ~~>[Z, R](f: (Z, A, B, C, D, E) => R): ReductionRule1[Z, R]
- def ~~>[R](f: (A, B, C, D, E) => R): Rule1[R]
- def ~~>[R](f: (B, C, D, E) => R): Rule2[A, R]
- def ~~>[R](f: (C, D, E) => R): Rule3[A, B, R]
- def ~~>[R](f: (D, E) => R): Rule4[A, B, C, R]
- def ~~>[R](f: (E) => R): Rule5[A, B, C, D, R]
- def ~~?[Y, Z](f: (Y, Z, A, B, C, D, E) => Boolean): PopRule2[Y, Z]
- def ~~?[Z](f: (Z, A, B, C, D, E) => Boolean): PopRule1[Z]
- def ~~?(f: (A, B, C, D, E) => Boolean): Rule0
- def ~~?(f: (B, C, D, E) => Boolean): Rule1[A]
- def ~~?(f: (C, D, E) => Boolean): Rule2[A, B]
- def ~~?(f: (D, E) => Boolean): Rule3[A, B, C]
- def ~~?(f: (E) => Boolean): Rule4[A, B, C, D]
- def ~~~%(f: (A, B, C, D, E) => Unit): Rule5[A, B, C, D, E]
- def ~~~%(f: (B, C, D, E) => Unit): Rule5[A, B, C, D, E]
- def ~~~%(f: (C, D, E) => Unit): Rule5[A, B, C, D, E]
- def ~~~%(f: (D, E) => Unit): Rule5[A, B, C, D, E]
- def ~~~%(f: (E) => Unit): Rule5[A, B, C, D, E]
- def ~~~>[R](f: (A, B, C, D, E) => R): Rule6[A, B, C, D, E, R]
- def ~~~>[R](f: (B, C, D, E) => R): Rule6[A, B, C, D, E, R]
- def ~~~>[R](f: (C, D, E) => R): Rule6[A, B, C, D, E, R]
- def ~~~>[R](f: (D, E) => R): Rule6[A, B, C, D, E, R]
- def ~~~>[R](f: (E) => R): Rule6[A, B, C, D, E, R]
- def ~~~?(f: (A, B, C, D, E) => Boolean): Rule5[A, B, C, D, E]
- def ~~~?(f: (B, C, D, E) => Boolean): Rule5[A, B, C, D, E]
- def ~~~?(f: (C, D, E) => Boolean): Rule5[A, B, C, D, E]
- def ~~~?(f: (D, E) => Boolean): Rule5[A, B, C, D, E]
- def ~~~?(f: (E) => Boolean): Rule5[A, B, C, D, E]
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
(Since version 9)