Main

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def OnceParser[T](f: (Input) ⇒ ParseResult[T]): Parser[T] with OnceParser[T]

def Parser[T](f: (Input) ⇒ ParseResult[T]): Parser[T]

def accept[U](expected: String, f: PartialFunction[Elem, U]): Parser[U]

def accept[ES](es: ES)(implicit arg0: (ES) ⇒ List[Elem]): Parser[List[Elem]]

implicit def accept(e: Elem): Parser[Elem]

def acceptIf(p: (Elem) ⇒ Boolean)(err: (Elem) ⇒ String): Parser[Elem]

def acceptMatch[U](expected: String, f: PartialFunction[Elem, U]): Parser[U]

def acceptSeq[ES](es: ES)(implicit arg0: (ES) ⇒ Iterable[Elem]): Parser[List[Elem]]

def ampersand: Doc

def angles(d: Doc): Doc

def any(a: Any): Doc

def any: PackratParser[Char]

implicit def anyToPrettyPrintable(a: Any): PrettyPrintable

final def asInstanceOf[T0]: T0

def asterisk: Doc

lazy val atom: Parser[String]

def atsign: Doc

def backquote: Doc

def backslash: Doc

def braces(d: Doc): Doc

def brackets(d: Doc): Doc

def caret: Doc

def cat(ds: Seq[Doc]): Doc

def chainl1[T, U](first: ⇒ Parser[T], p: ⇒ Parser[U], q: ⇒ Parser[(T, U) ⇒ T]): Parser[T]

def chainl1[T](p: ⇒ Parser[T], q: ⇒ Parser[(T, T) ⇒ T]): Parser[T]

def chainr1[T, U](p: ⇒ Parser[T], q: ⇒ Parser[(T, U) ⇒ U], combine: (T, U) ⇒ U, first: U): Parser[U]

implicit def char(c: Char): Doc

lazy val clause: Parser[Clause with Serializable]

def clone(): AnyRef

def colon: Doc

def comma: Doc

def commit[T](p: ⇒ Parser[T]): Parser[T]

implicit def constToTupleFunction2[A, B, R](r: (A, B) ⇒ R): (~[A, B]) ⇒ R

implicit def constToTupleFunction3[A, B, C, R](r: (A, B, C) ⇒ R): (~[~[A, B], C]) ⇒ R

implicit def constToTupleFunction4[A, B, C, D, R](r: (A, B, C, D) ⇒ R): (~[~[~[A, B], C], D]) ⇒ R

implicit def constToTupleFunction5[A, B, C, D, E, R](r: (A, B, C, D, E) ⇒ R): (~[~[~[~[A, B], C], D], E]) ⇒ R

implicit def constToTupleFunction6[A, B, C, D, E, F, R](r: (A, B, C, D, E, F) ⇒ R): (~[~[~[~[~[A, B], C], D], E], F]) ⇒ R

lazy val constrainedInt: PackratParser[Int]

lazy val cut: Parser[Cut]

val defaultIndent: Int

val defaultWidth: Int

def dollar: Doc

def dot: Doc

def dquote: Doc

def dquotes(d: Doc): Doc

def elem(e: Elem): Parser[Elem]

def elem(kind: String, p: (Elem) ⇒ Boolean): Parser[Elem]

val emitter: Emitter

def empty: Doc

def enclose(l: Doc, d: Doc, r: Doc): Doc

final def eq(arg0: AnyRef): Boolean

def equal: Doc

def equals(arg0: Any): Boolean

def err(msg: String): Parser[Nothing]

def exclamation: Doc

def failure(msg: String): Parser[Nothing]

def fillcat(ds: Seq[Doc]): Doc

def fillsep(ds: Seq[Doc], sep: Doc): Doc

def fillsep(ds: Seq[Doc]): Doc

def finalize(): Unit

def forwslash: Doc

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

def group(d: Doc): Doc

def guard[T](p: ⇒ Parser[T]): Parser[T]

def handleWhiteSpace(in: Input): Int

def handleWhiteSpace(source: CharSequence, offset: Int): Int

def hash: Doc

def hashCode(): Int

def hcat(ds: Seq[Doc]): Doc

def hsep(ds: Seq[Doc], sep: Doc): Doc

def hsep(ds: Seq[Doc]): Doc

def ignoreWhitespaceLines: Boolean

lazy val integer: Parser[Integer]

final def isInstanceOf[T0]: Boolean

def keywords(ext: Regex, kws: List[String]): Parser[String]

def langle: Doc

var lastNoSuccess: NoSuccess

def lbrace: Doc

def lbracket: Doc

def line: Doc

def linebreak: Doc

def list[T](l: List[T], prefix: String, elemToDoc: (T) ⇒ Doc, sep: Doc, sepfn: (Seq[Doc], Doc) ⇒ Doc): Doc

lazy val list: Parser[Literal]

lazy val listterms: PackratParser[Literal]

implicit def literal(s: String): Parser[String]

lazy val literal: PackratParser[Literal]

lazy val literals: Parser[List[Literal]]

def log[T](p: ⇒ Parser[T])(name: String): Parser[T]

def lparen: Doc

def lsep(ds: Seq[Doc], sep: Doc): Doc

def lsep2(ds: Seq[Doc], sep: Doc): Doc

def lterm(ds: Seq[Doc], term: Doc): Doc

def main(args: Array[String]): Unit

def memo[T](p: Parser[T]): PackratParser[T]

def minus: Doc

def mkList[T]: (~[T, List[T]]) ⇒ List[T]

final def ne(arg0: AnyRef): Boolean

def nest(d: Doc, j: Indent): Doc

def not[T](p: ⇒ Parser[T]): Parser[Unit]

final def notify(): Unit

final def notifyAll(): Unit

def opt[T](p: ⇒ Parser[T]): Parser[Option[T]]

def parens(d: Doc): Doc

def parse[T](p: Parser[T], in: Reader): ParseResult[T]

def parse[T](p: Parser[T], in: CharSequence): ParseResult[T]

def parse[T](p: Parser[T], in: Reader[Char]): ParseResult[T]

def parseAll[T](p: Parser[T], in: CharSequence): ParseResult[T]

def parseAll[T](p: Parser[T], in: Reader): ParseResult[T]

def parseAll[T](p: Parser[T], in: Reader[Char]): ParseResult[T]

def parseAndPosition[T](f: (Input) ⇒ ParseResult[T], in: Input): ParseResult[T]

implicit def parseResultToTuple2[A, B](p: Parser[~[A, B]]): PackratParser[(A, B)]

implicit def parseResultToTuple3[A, B, C](p: Parser[~[~[A, B], C]]): PackratParser[(A, B, C)]

implicit def parseResultToTuple4[A, B, C, D](p: Parser[~[~[~[A, B], C], D]]): PackratParser[(A, B, C, D)]

implicit def parseResultToTuple5[A, B, C, D, E](p: Parser[~[~[~[~[A, B], C], D], E]]): PackratParser[(A, B, C, D, E)]

implicit def parseResultToTuple6[A, B, C, D, E, F](p: Parser[~[~[~[~[~[A, B], C], D], E], F]]): PackratParser[(A, B, C, D, E, F)]

def parseString[T](parser: Parser[T], str: String): Either[T, String]

lazy val parser: PackratParser[Program]

implicit def parser2packrat[T](p: ⇒ Parser[T]): PackratParser[T]

def percent: Doc

def phrase[T](p: Parser[T]): PackratParser[T]

def plist(l: List[PrettyPrintable], prefix: String, elemToDoc: (PrettyPrintable) ⇒ Doc, sep: Doc, sepfn: (Seq[Doc], Doc) ⇒ Doc): Doc

def plus: Doc

def positioned[T <: Positional](p: ⇒ Parser[T]): Parser[T]

def pretty(d: Doc, w: Width): Layout

def pretty(p: PrettyPrintable): Layout

def pretty_any(a: Any): Layout

def process(querytree: Literal): Unit

Process a query by passing it and the program to the interpreter.

def processline(line: String): Unit

def processprogram(tree: Program): Boolean

Process the program by analysing it to check for semantic errors.

lazy val program: Parser[Program]

var programtree: Program

If the program is correct, this is the tree representing it.

val prompt: String

The prompt to print before each line of input is read.

lazy val query: Parser[Literal]

def question: Doc

def rangle: Doc

def rbrace: Doc

def rbracket: Doc

implicit def regex(r: Regex): Parser[String]

def regexnows(r: Regex): Parser[String]

def rep[T](p: ⇒ Parser[T]): Parser[List[T]]

def rep1[T](first: ⇒ Parser[T], p0: ⇒ Parser[T]): Parser[List[T]]

def rep1[T](p: ⇒ Parser[T]): Parser[List[T]]

def rep1sep[T](p: ⇒ Parser[T], q: ⇒ Parser[Any]): Parser[List[T]]

def repN[T](num: Int, p: ⇒ Parser[T]): Parser[List[T]]

def repsep[T](p: ⇒ Parser[T], q: ⇒ Parser[Any]): Parser[List[T]]

def result[T](v: ⇒ T): Parser[T]

def rparen: Doc

def semi: Doc

def sep(ds: Seq[Doc]): Doc

def setup(args: Array[String]): Boolean

def skipWhitespace: Boolean

def softbreak: Doc

def softline: Doc

def space: Doc

def spaces(n: Int): Doc

def squote: Doc

def squotes(d: Doc): Doc

def ssep(ds: Seq[Doc], sep: Doc): Doc

val start: Parser[Literal]

The parser to use to parse each line of interactive input.

def sterm(ds: Seq[Doc], term: Doc): Doc

def string(s: String): Doc

def stringToInt(s: String): Either[Int, String]

def success[T](v: T): Parser[T]

def surround(d: Doc, b: Doc): Doc

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

lazy val term: Parser[Term]

lazy val terms: Parser[List[Term]]

implicit def text(t: String): Doc

def tilde: Doc

def toString(): String

def underscore: Doc

def value(v: Any): Doc

lazy val varr: Parser[String]

def vcat(ds: Seq[Doc]): Doc

def verticalbar: Doc

def vsep(ds: Seq[Doc], sep: Doc): Doc

def vsep(ds: Seq[Doc]): Doc

final def wait(): Unit

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

final def wait(arg0: Long): Unit

val whiteSpace: Regex

def wrap[T, U](p: ⇒ Parser[T], f: (T) ⇒ Either[U, String]): Parser[U]

def product(p: Any): Doc