PopRule

val matcher : Matcher

def withMatcher (matcher: Matcher): PopRule.this.type

def != (arg0: AnyRef): Boolean

def != (arg0: Any): Boolean

def ## (): Int

def == (arg0: AnyRef): Boolean

def == (arg0: Any): Boolean

def append (other: Matcher): Matcher

def append (other: Rule): Matcher

def append (f: (Context[Any]) ⇒ Boolean): Matcher

def append (action: org.parboiled.Action[_]): Matcher

def appendChoice (other: Matcher): Matcher

def appendChoice (other: Rule): Matcher

def asInstanceOf [T0] : T0

def clone (): AnyRef

def eq (arg0: AnyRef): Boolean

def equals (arg0: Any): Boolean

def finalize (): Unit

def getClass (): java.lang.Class[_]

def hashCode (): Int

def isInstanceOf [T0] : Boolean

def label (label: String): PopRule.this.type

def memoMismatches : PopRule.this.type

def ne (arg0: AnyRef): Boolean

def notify (): Unit

def notifyAll (): Unit

def skipNode : PopRule.this.type

def suppressNode : PopRule.this.type

def suppressSubnodes : PopRule.this.type

def synchronized [T0] (arg0: ⇒ T0): T0

def toString (): String

def unary_! : Rule0

Creates a "NOT" syntactic predicate according to the PEG formalism.

def wait (): Unit

def wait (arg0: Long, arg1: Int): Unit

def wait (arg0: Long): Unit

def ~ (other: Rule0): PopRule.this.type

Connects two rules into a rule a sequence.

def ~% (f: (String) ⇒ Unit): PopRule.this.type

Creates a simple parser action with the input text matched by the immediately preceding rule as parameter.

def ~:% (f: (Char) ⇒ Unit): PopRule.this.type

Creates a simple parser action with the first char of the input text matched by the immediately preceding rule as parameter.

def ~:? (f: (Char) ⇒ Boolean): PopRule.this.type

Creates a semantic predicate on the first char of the input text matched by the immediately preceding rule.

def ~? (f: (String) ⇒ Boolean): PopRule.this.type

Creates a semantic predicate on the input text matched by the immediately preceding rule.