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 any: PackratParser[Char]

lazy val applic: PackratParser[Expr]

final def asInstanceOf[T0]: T0

def bindexpr(rhsexpr: PackratParser[Expr]): PackratParser[Binding]

Parse let and letrec expressions

lazy val blockexpr: PackratParser[Expr]

Parse code blocks

lazy val callccexpr: PackratParser[Expr]

Continuation handling.

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]

def clone(): AnyRef

val code: (Iswim) ⇒ CodeTree

The following attribute contains the SECD bytecode generated from the ISWIM syntax node it is attached to.

lazy val comment: PackratParser[Any]

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]

def decimalNumber: Parser[String]

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

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

val emitter: Emitter

lazy val emptyexpr: PackratParser[Expr]

Parse tuple / record expressions

val envir: (Iswim) ⇒ Map[Variable, Iswim]

Simple name analysis - using an environment All we need to do here is check that at use sites all variables have been bound by an enclosing let, letrec or function parameter.

val envirOut: (Iswim) ⇒ Map[Variable, Iswim]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

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

lazy val expr: PackratParser[Expr]

lazy val exprstmt: PackratParser[Stmt]

lazy val factor: PackratParser[Expr]

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

def finalize(): Unit

def floatingPointNumber: Parser[String]

final def getClass(): Class[_]

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

def handleWhiteSpace(in: Input): Int

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

def hashCode(): Int

def ident: Parser[String]

lazy val identRegex: Regex

lazy val ifelseexpr: PackratParser[Expr]

Parse if .

lazy val importstmt: PackratParser[Stmt]

lazy val intRegex: Regex

final def isInstanceOf[T0]: Boolean

val isSemanticallyCorrect: (Iswim) ⇒ Boolean

def keyword(k: String): Parser[Pos]

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

lazy val lambdaexpr: PackratParser[Expr]

Parse lambda (fun) expressions

lazy val letexpr: PackratParser[Expr]

lazy val letrecexpr: PackratParser[Expr]

lazy val letrecstmt: PackratParser[Stmt]

lazy val letstmt: PackratParser[Stmt]

Parse toplevel statements

lazy val liter: Parser[Expr]

Literals, identifiers, keywords and other atomic phrases

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

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

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

lazy val matchclause: PackratParser[MatchClause]

lazy val matchexpr: PackratParser[Expr]

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

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

lazy val mkrefexpr: PackratParser[Expr]

def name(msg: String): Parser[Variable]

final def ne(arg0: AnyRef): Boolean

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

final def notify(): Unit

final def notifyAll(): Unit

def operator(op: String): Parser[Pos]

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

lazy val parenexpr: PackratParser[Expr]

Precedence based infix expression parsers.

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]

def parseWhitespace(in: Input): ParseResult[Any]

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

var parsingWhitespace: Boolean

lazy val pattern: PackratParser[(Pos, List[Variable])]

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

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

lazy val primstmt: PackratParser[Stmt]

Primitives

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]]

val reserved: HashSet[String]

Identifiers - keywords and names.

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

lazy val returnexpr: PackratParser[Expr]

Parse return expressions

def skipWhitespace: Boolean

lazy val start: PackratParser[IswimProg]

Top level parsers

def stringLiteral: Parser[String]

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

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

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

lazy val term1: PackratParser[Expr]

lazy val term2: PackratParser[Expr]

lazy val term3: PackratParser[Expr]

lazy val term4: PackratParser[Expr]

lazy val throwtoexpr: PackratParser[Expr]

def toString(): String

lazy val tupleexpr: PackratParser[Expr]

val unreachable: (MatchClause) ⇒ Boolean

Check for match clauses which are unreachable because they are preceeded by a clauses which match any value.

lazy val valexpr: PackratParser[Expr]

References.

lazy val variable: Parser[Variable]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

lazy val whileexpr: PackratParser[Expr]

Parse while expression

val whiteSpace: Regex

lazy val whitespaceParser: PackratParser[Any]

def wholeNumber: Parser[String]

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

def lastNoSuccess: NoSuccess

def lastNoSuccess_=(x: NoSuccess): Unit