Parser

abstract def apply(v1: Input): ParseResult[T]

final def !=(arg0: Any): Boolean

final def ##(): Int

def <~[U](q: ⇒ Parser[U]): Parser[T]

Sequential composition ignoring right side.

def <~/[U](q: ⇒ Parser[U]): Parser[T]

Sequential composition with no back-tracking back past this point and ignoring right side.

final def ==(arg0: Any): Boolean

def ?: Parser[Option[T]]

Optional parsing.

def ^^[U](f: (T) ⇒ U): Parser[U]

Apply function to successful result.

def ^^^[U](u: ⇒ U): Parser[U]

Turn a successful result into a specific value which is evaluated each each time this parser is used.

def andThen[A](g: (ParseResult[T]) ⇒ A): (Input) ⇒ A

def append[U >: T](q: ⇒ Parser[U]): Parser[U]

def apply(str: String): ParseResult[T]

Alternative entry point to directly parse a string.

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def compose[A](g: (A) ⇒ Input): (A) ⇒ ParseResult[T]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def flatMap[U](f: (T) ⇒ Parser[U]): Parser[U]

final def getClass(): Class[_]

def hashCode(): Int

def into[U](fq: (T) ⇒ Parser[U]): Parser[U]

Parameterise next parse step by result from previous one.

final def isInstanceOf[T0]: Boolean

def map[U](f: (T) ⇒ U): Parser[U]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def |[U >: T](q: ⇒ Parser[U]): Parser[U]

Alternation.

def ~[U](q: ⇒ Parser[U]): Parser[~[T, U]]

Sequential composition.

def ~/[U](q: ⇒ Parser[U]): Parser[~[T, U]]

Sequential composition with no back-tracking back past this point.

def ~/>[U](q: ⇒ Parser[U]): Parser[U]

Sequential composition with no back-tracking back past this point and ignoring left side.

def ~>[U](q: ⇒ Parser[U]): Parser[U]

Sequential composition ignoring left side.