Compiler

abstract def parser: Parser[T]

The actual parser used to produce the AST.

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

object Next extends Step with Product with Serializable

A step to the previous node in a sequence.

object NoSuccess

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

object Other extends Step with Product with Serializable

A step to a node that doesn't fit into any of the other categories.

object Parent extends Step with Product with Serializable

A step to the parent of the current node.

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

object Prev extends Step with Product with Serializable

A step to the previous node in a sequence.

object Self extends Step with Product with Serializable

A step nowhere.

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

final def asInstanceOf[T0]: T0

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 checkFor(record: Record, dim: Dimension, eventtype: String, needed: Dimension)(f: (Value) ⇒ Value): Value

def clone(): AnyRef

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

def createConfig(args: Seq[String], output: Emitter = new OutputEmitter, error: Emitter = new ErrorEmitter): Config

Create the configuration for a particular run of the compiler.

def dimValue(record: Record, dim: Dimension): Value

Support Kiama-specific profiling dimensions.

def driver(args: Seq[String]): Unit

Driver for this compiler.

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

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

def encoding: String

The character encoding of input files read by this compiler.

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

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

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

def finalize(): Unit

def finishReport(): Unit

final def getClass(): Class[_]

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

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

def hashCode(): Int

def includeTimings: Boolean

def isEventType(record: Record, eventtype: String): Boolean

final def isInstanceOf[T0]: Boolean

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

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

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

The entry point for this compiler.

def makeast(reader: Reader, filename: String, config: Config): Either[T, String]

Make an AST by running the parser, reporting errors if the parse fails.

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

def nanoToMs(nano: Long): Long

final def ne(arg0: AnyRef): Boolean

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 output(str: String): Unit

def outputln(str: String): Unit

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 parseProfileOption(value: String): Seq[Dimension]

def percent(v: Long, total: Long): String

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

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

def prettyprint(ast: T): String

Pretty-print an abstract syntax trees.

def printDependencyGraph(record: Record, dim: Dimension): Unit

Print the dependency graph for the attribute evaluation represented by record.

def printReports(totalTime: Long, dimensionNames: Seq[Dimension], records: List[Record]): Unit

var printTables: Boolean

def process(filename: String, ast: T, config: Config): Unit

Process the AST by performing any processing at the next level up and then initialising the AST for attribution.

def processfile(filename: String, config: Config): Unit

Process a file argument by using makeast to turn their contents into abstract syntax trees (ASTs) and then by process which conducts arbitrary processing on the ASTs.

def processfiles(filenames: Seq[String], config: Config): Unit

Process the files one by one.

def profile[T](computation: ⇒ T, dimensionNames: Seq[Dimension], logging: Boolean): T

def profileStart(logging: Boolean): Unit

def profileStop(): (Seq[Dimension]) ⇒ Unit

def profileStop(dimensionNames: Seq[Dimension]): Unit

def profileStopInteractive(): Unit

implicit def regex(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 skipWhitespace: Boolean

def startReport(dimensionNames: Seq[Dimension]): Unit

Take any actions that need to be done at the start of reporting.

var startTime: Long

def subjectsToStep(src: Any, dst: Any): Step

Summarise the single step between two nodes at which attributes have been evaluated.

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

def summariseAlongDims(dimensionNames: Seq[Dimension], records: List[Record], nrecords: Int, profiledTime: Long): Unit

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

def time[T](computation: ⇒ T, warmup: Int, n: Int, discard: Int): Unit

def toString(): String

def trace(predicate: (Event) ⇒ Boolean): Unit

def valueToString(a: Value): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

val whiteSpace: Regex