Core

abstract def Block: R1

abstract def SSKeyword: R1

abstract def input: ParserInput

abstract val settings: Seq[String]

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

def #: R1

final def ##(): Int

def &(r: Rule[_, _]): Rule0

def :: R1

def <%: R1

def <-: Rule[HNil, ::[String, HNil]]

def <:: R1

def =: R1

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def =>: Rule[HNil, ::[String, HNil]]

def >:: R1

def @: R1

def ANY: Rule0

object Basic

def Code(code: ⇒ Unit): Rule0

def Concat: (S, S) ⇒ S

def Concat3: (S, S, S) ⇒ S

def Concat4: (S, S, S, S) ⇒ S

def Concat5: (S, S, S, S, S) ⇒ S

def Concat6: (S, S, S, S, S, S) ⇒ S

def Concat7: (S, S, S, S, S, S, S) ⇒ S

def ConcatSeq(delimiter: String): (Seq[String]) ⇒ String

def ConcatSeqComma: (Seq[String]) ⇒ String

def ConcatSeqDot: (Seq[String]) ⇒ String

def ConcatSeqNoDelim: (Seq[String]) ⇒ String

def ConcatSeqPipe: (Seq[String]) ⇒ String

def ConcatSeqSemi: (Seq[String]) ⇒ String

def ConcatSeqWith: (Seq[String]) ⇒ String

def EOI: Char

def ExtractOpt: (Option[String]) ⇒ String

def Id: R1

object IdBank extends ScopeBank[String]

object Identifiers

def Ids: R1

object Key

Most keywords don't just require the correct characters to match, they have to ensure that subsequent characters *don't* match in order for it to be a keyword.

object KeyWordOperators

Most keywords don't just require the correct characters to match, they have to ensure that subsequent characters *don't* match in order for it to be a keyword.

def Literal: R1

object Literals

def MATCH: Rule0

def MISMATCH[I <: HList, O <: HList]: Rule[I, O]

def MISMATCH0: Rule0

def Newline: R1

def NotNewline: R1

def OneNLMax: R1

def OneOrMore(term: () ⇒ Rule1[String], delim: () ⇒ Rule1[String]): Rule1[String]

def OneOrMoreSeq[A, B](term: () ⇒ Rule1[A], delim: () ⇒ Rule1[B]): Rule1[(A, Seq[(B, A)])]

def QualId: R1

object ScopeSwitch extends Switch

def SecondStr: (S, S) ⇒ S

def Semi: R1

def SemiR0: R0

def Semis: R1

def SemisR0: R0

def StableId: R1

def Try[T](rle: () ⇒ Rule1[T], before: ⇒ Unit, after: ⇒ Unit = (), rollback: ⇒ Unit = ()): Rule1[T]

def VarId: R1

def WL: R1

def WLOneOrMoreR0: R0

def WLOneR0: R0

Parses whitespace, including newlines.

def WLR0: R0

def WS: R1

def WSOneOrMoreR0: R0

def WSOneR0: R0

Parses all whitespace, excluding newlines.

def WSR0: R0

def WithAssignment[T](rle: () ⇒ Rule1[T]): Rule1[T]

def WithLaunch[T](rle: () ⇒ Rule1[T]): Rule1[T]

def WithLaunchAnchor[T](rle: () ⇒ Rule1[T]): Rule1[T]

def WithNiceScriptCall[T](rle: () ⇒ Rule1[T]): Rule1[T]

def WithNormal[T](rle: () ⇒ Rule1[T]): Rule1[T]

def WithNormalInScript[T](rle: () ⇒ Rule1[T]): Rule1[T]

def WithParentheses[T](rle: () ⇒ Rule1[T]): Rule1[T]

def WithPattern[T](rle: () ⇒ Rule1[T]): Rule1[T]

def WithScope[T](rle: () ⇒ Rule1[T], scope: Int): Rule1[T]

def WithScript[T](rle: () ⇒ Rule1[T]): Rule1[T]

def ZeroOrMore(term: () ⇒ Rule1[String], delim: () ⇒ Rule1[String]): Rule1[String]

def ZeroOrMoreSeq[A, B](term: () ⇒ Rule1[A], delim: () ⇒ Rule1[B]): Rule1[Option[(A, Seq[(B, A)])]]

def _: R1

def _*: R1

def __advance(): Boolean

def __bubbleUp(prefix: List[NonTerminal], terminal: Terminal): Nothing

def __bubbleUp(terminal: Terminal): Nothing

def __enterAtomic(start: Int): Boolean

def __enterNotPredicate(): AnyRef

def __enterQuiet(): Int

def __exitAtomic(saved: Boolean): Unit

def __exitNotPredicate(saved: AnyRef): Unit

def __exitQuiet(saved: Int): Unit

def __hardFail(expected: String): Nothing

def __inErrorAnalysis: Boolean

final def __matchAnyOf(string: String, ix: Int): Boolean

final def __matchIgnoreCaseString(string: String, ix: Int): Boolean

final def __matchIgnoreCaseStringWrapped(string: String, ix: Int): Boolean

def __matchMap(m: Map[String, Any]): Boolean

def __matchMapWrapped(m: Map[String, Any]): Boolean

final def __matchNoneOf(string: String, ix: Int): Boolean

final def __matchString(string: String, ix: Int): Boolean

final def __matchStringWrapped(string: String, ix: Int): Boolean

def __push(value: Any): Boolean

def __registerMismatch(): Boolean

def __restoreState(mark: Mark): Unit

def __run[L <: HList](rule: ⇒ RuleN[L])(implicit scheme: DeliveryScheme[L]): Result

def __saveState: Mark

def __updateMaxCursor(): Boolean

def abstract: R1

def anyOf(chars: String): Rule0

final def asInstanceOf[T0]: T0

def atomic[I <: HList, O <: HList](r: Rule[I, O]): Rule[I, O]

def capture[I <: HList, O <: HList](r: Rule[I, O])(implicit p: Prepend[O, ::[String, HNil]]): Rule[I, Out]

def case: R1

def catch: R1

implicit def ch(c: Char): Rule0

def charAt(offset: Int): Char

def charAtRC(offset: Int): Char

def class: R1

def clone(): AnyRef

def copyStateFrom(other: Parser, offset: Int): Unit

def cursor: Int

def cursorChar: Char

def def: R1

def do: R1

def drop[T](implicit h: HListable[T]): PopRule[Out]

def else: R1

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def errorTraceCollectionLimit: Int

def extends: R1

def fail(expected: String): Rule0

def failX[I <: HList, O <: HList](expected: String): Rule[I, O]

def final: R1

def finalize(): Unit

def finally: R1

def for: R1

def forSome: R1

def formatError(error: ParseError, formatter: ErrorFormatter): String

final def getClass(): Class[_]

def hashCode(): Int

def if: R1

def ignoreCase(s: String): Rule0

def ignoreCase(c: Char): Rule0

def implicit: R1

def import: R1

implicit def int2NTimes(i: Int): NTimes

final def isInstanceOf[T0]: Boolean

def lastChar: Char

def lazy: R1

def macro: R1

def match: R1

def namedRule[I <: HList, O <: HList](name: String)(r: Rule[I, O]): Rule[I, O]

final def ne(arg0: AnyRef): Boolean

def new: R1

def noneOf(chars: String): Rule0

final def notify(): Unit

final def notifyAll(): Unit

def object: R1

def oneOrMore[I <: HList, O <: HList](r: Rule[I, O])(implicit l: Lifter[Seq, I, O]): Rule[In, StrictOut] with Repeated

def optional[I <: HList, O <: HList](r: Rule[I, O])(implicit l: Lifter[Option, I, O]): Rule[In, OptionalOut]

def override: R1

def package: R1

def pr(s: String): Rule[HNil, HNil]

helper printing function

implicit def predicate(p: CharPredicate): Rule0

def private: R1

def protected: R1

def push[T](value: T)(implicit h: HListable[T]): RuleN[Out]

def quiet[I <: HList, O <: HList](r: Rule[I, O]): Rule[I, O]

implicit def range2NTimes(range: Range): NTimes

def return: R1

def rule[I <: HList, O <: HList](r: Rule[I, O]): Rule[I, O]

implicit def rule2ActionOperator[I <: HList, O <: HList](r: Rule[I, O])(implicit ops: ActionOps[I, O]): ActionOperator[I, O, Out]

implicit def rule2WithSeparatedBy[I <: HList, O <: HList](r: Rule[I, O] with Repeated): WithSeparatedBy[I, O]

def run[T](arg: T)(implicit rr: RunResult[T]): Out

def runSubParser[I <: HList, O <: HList](f: (ParserInput) ⇒ Rule[I, O]): Rule[I, O]

def sealed: R1

implicit def str(s: String): Rule0

implicit def str2CharRangeSupport(s: String): CharRangeSupport

def super: R1

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

def test(condition: Boolean): Rule0

def then: R1

def this: R1

def throw: R1

def toString(): String

def trait: R1

def try: R1

def type: R1

def val: R1

implicit def valueMap[T](m: Map[String, T])(implicit h: HListable[T]): RuleN[Out]

def valueStack: ValueStack

def var: R1

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def while: R1

def with: R1

def withR0: Rule0

def yield: R1

def zeroOrMore[I <: HList, O <: HList](r: Rule[I, O])(implicit l: Lifter[Seq, I, O]): Rule[In, OptionalOut] with Repeated

def {: R1

def }: R1