ScalaSigParsers

Type Members

class DefaultRule[In, Out, A, X] extends Rule[In, Out, A, X]

Definition Classes
Rules
trait FromRule[In] extends AnyRef

Definition Classes
Rules
type Parser[A] = scalap.Rule[S, S, A, String]
type Rule[+A, +X] = scalap.Rule[S, S, A, X]

Definition Classes
StateRules
type S = ScalaSig

Definition Classes
ScalaSigParsers → StateRules

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def allEntries[A](f: EntryParser[A]): scalap.Rule[S, S, List[A], String]
def allOf[A, X](rules: Seq[Rule[A, X]]): (S) ⇒ Result[S, List[A], X]

Create a rule that succeeds if all of the given rules succeed.
Create a rule that succeeds if all of the given rules succeed.
rules
the rules to apply in sequence.

Definition Classes
StateRules
def anyOf[A, X](rules: Seq[Rule[A, X]]): scalap.Rule[S, S, List[A], X]

Create a rule that succeeds with a list of all the provided rules that succeed.
Create a rule that succeeds with a list of all the provided rules that succeed.
rules
the rules to apply in sequence.

Definition Classes
StateRules
def apply[A, X](f: (S) ⇒ Result[S, A, X]): scalap.Rule[S, S, A, X]

Definition Classes
StateRules
final def asInstanceOf[T0]: T0

Definition Classes
Any
lazy val attributes: scalap.Rule[S, S, List[AttributeInfo], String] with Name
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def cond(f: (S) ⇒ Boolean): scalap.Rule[S, S, S, Nothing]

Create a rule that identities if f(in) is true.
Create a rule that identities if f(in) is true.

Definition Classes
StateRules
lazy val entries: scalap.Rule[S, S, List[Any], String] with Name
def entry(index: Int): scalap.Rule[S, Entry, Int, Nothing]
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def error[X](err: X): scalap.Rule[Any, Nothing, Nothing, X]

Definition Classes
Rules
def error[In]: scalap.Rule[In, Nothing, Nothing, In]

Definition Classes
Rules
def expect[In, Out, A, Any](rule: scalap.Rule[In, Out, A, Any]): (In) ⇒ A

Converts a rule into a function that throws an Exception on failure.
Converts a rule into a function that throws an Exception on failure.

Definition Classes
Rules
val factory: RulesWithState

Definition Classes
RulesWithState → StateRules
def failure: scalap.Rule[Any, Nothing, Nothing, Nothing]

Definition Classes
Rules
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def from[In]: FromRule[In]

Definition Classes
Rules
def get: scalap.Rule[S, S, S, Nothing]

Definition Classes
StateRules
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
implicit def inRule[In, Out, A, X](rule: scalap.Rule[In, Out, A, X]): InRule[In, Out, A, X]

Definition Classes
Rules
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def memo[In <: Memoisable, Out, A, X](key: AnyRef)(toRule: ⇒ (In) ⇒ Result[Out, A, X]): scalap.Rule[In, Out, A, X]

Definition Classes
MemoisableRules
lazy val methods: scalap.Rule[S, S, List[MethodSymbol], String] with Name
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def nil: scalap.Rule[S, S, Nil.type, Nothing]

Definition Classes
StateRules
def none: scalap.Rule[S, S, None.type, Nothing]

Definition Classes
StateRules
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def oneOf[In, Out, A, X](rules: scalap.Rule[In, Out, A, X]*): scalap.Rule[In, Out, A, X]

Definition Classes
Rules
def parseEntry[A](parser: EntryParser[A])(index: Int): Parser[A]
def read[A](f: (S) ⇒ A): scalap.Rule[S, S, A, Nothing]

Definition Classes
StateRules
def repeatUntil[T, X](rule: Rule[(T) ⇒ T, X])(finished: (T) ⇒ Boolean)(initial: T): scalap.Rule[S, S, T, X]

Repeatedly apply a rule from initial value until finished condition is met.
Repeatedly apply a rule from initial value until finished condition is met.

Definition Classes
StateRules
implicit def rule[In, Out, A, X](f: (In) ⇒ Result[Out, A, X]): scalap.Rule[In, Out, A, X]

Definition Classes
Rules
def ruleWithName[In, Out, A, X](name: String, f: (In) ⇒ Result[Out, A, X]): scalap.Rule[In, Out, A, X] with Name

Definition Classes
MemoisableRules → Rules
implicit def seqRule[In, A, X](rule: scalap.Rule[In, In, A, X]): SeqRule[In, A, X]

Definition Classes
Rules
def set(s: ⇒ S): scalap.Rule[S, S, S, Nothing]

Definition Classes
StateRules
val size: scalap.Rule[S, S, Int, Nothing]
def state[s]: StateRules { type S = s }

Definition Classes
Rules
def success[Out, A](out: Out, a: A): scalap.Rule[Any, Out, A, Nothing]

Definition Classes
Rules
val symTab: scalap.Rule[S, S, Seq[~[Int, ByteCode]], Nothing]
lazy val symbols: scalap.Rule[S, S, List[Symbol], String] with Name
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
lazy val topLevelClasses: scalap.Rule[S, S, List[ClassSymbol], String]
lazy val topLevelObjects: scalap.Rule[S, S, List[ObjectSymbol], String]
def unit[A](a: ⇒ A): scalap.Rule[S, S, A, Nothing]

Definition Classes
StateRules
def update(f: (S) ⇒ S): scalap.Rule[S, S, S, Nothing]

Definition Classes
StateRules
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Doc: package scalasig

object ScalaSigParsers extends RulesWithState with MemoisableRules

Type Members

class DefaultRule[In, Out, A, X] extends Rule[In, Out, A, X]

trait FromRule[In] extends AnyRef

type Parser[A] = scalap.Rule[S, S, A, String]

type Rule[+A, +X] = scalap.Rule[S, S, A, X]

type S = ScalaSig

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def allEntries[A](f: EntryParser[A]): scalap.Rule[S, S, List[A], String]

def allOf[A, X](rules: Seq[Rule[A, X]]): (S) ⇒ Result[S, List[A], X]

def anyOf[A, X](rules: Seq[Rule[A, X]]): scalap.Rule[S, S, List[A], X]

def apply[A, X](f: (S) ⇒ Result[S, A, X]): scalap.Rule[S, S, A, X]

final def asInstanceOf[T0]: T0

lazy val attributes: scalap.Rule[S, S, List[AttributeInfo], String] with Name

def clone(): AnyRef

def cond(f: (S) ⇒ Boolean): scalap.Rule[S, S, S, Nothing]

lazy val entries: scalap.Rule[S, S, List[Any], String] with Name

def entry(index: Int): scalap.Rule[S, Entry, Int, Nothing]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def error[X](err: X): scalap.Rule[Any, Nothing, Nothing, X]

def error[In]: scalap.Rule[In, Nothing, Nothing, In]

def expect[In, Out, A, Any](rule: scalap.Rule[In, Out, A, Any]): (In) ⇒ A

val factory: RulesWithState

def failure: scalap.Rule[Any, Nothing, Nothing, Nothing]

def finalize(): Unit

def from[In]: FromRule[In]

def get: scalap.Rule[S, S, S, Nothing]

final def getClass(): Class[_]

def hashCode(): Int

implicit def inRule[In, Out, A, X](rule: scalap.Rule[In, Out, A, X]): InRule[In, Out, A, X]

final def isInstanceOf[T0]: Boolean

def memo[In <: Memoisable, Out, A, X](key: AnyRef)(toRule: ⇒ (In) ⇒ Result[Out, A, X]): scalap.Rule[In, Out, A, X]

lazy val methods: scalap.Rule[S, S, List[MethodSymbol], String] with Name

final def ne(arg0: AnyRef): Boolean

def nil: scalap.Rule[S, S, Nil.type, Nothing]

def none: scalap.Rule[S, S, None.type, Nothing]

final def notify(): Unit

final def notifyAll(): Unit

def oneOf[In, Out, A, X](rules: scalap.Rule[In, Out, A, X]*): scalap.Rule[In, Out, A, X]

def parseEntry[A](parser: EntryParser[A])(index: Int): Parser[A]

def read[A](f: (S) ⇒ A): scalap.Rule[S, S, A, Nothing]

def repeatUntil[T, X](rule: Rule[(T) ⇒ T, X])(finished: (T) ⇒ Boolean)(initial: T): scalap.Rule[S, S, T, X]

implicit def rule[In, Out, A, X](f: (In) ⇒ Result[Out, A, X]): scalap.Rule[In, Out, A, X]

def ruleWithName[In, Out, A, X](name: String, f: (In) ⇒ Result[Out, A, X]): scalap.Rule[In, Out, A, X] with Name

implicit def seqRule[In, A, X](rule: scalap.Rule[In, In, A, X]): SeqRule[In, A, X]

def set(s: ⇒ S): scalap.Rule[S, S, S, Nothing]

val size: scalap.Rule[S, S, Int, Nothing]

def state[s]: StateRules { type S = s }

def success[Out, A](out: Out, a: A): scalap.Rule[Any, Out, A, Nothing]

val symTab: scalap.Rule[S, S, Seq[~[Int, ByteCode]], Nothing]

lazy val symbols: scalap.Rule[S, S, List[Symbol], String] with Name

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

def toString(): String

lazy val topLevelClasses: scalap.Rule[S, S, List[ClassSymbol], String]

lazy val topLevelObjects: scalap.Rule[S, S, List[ObjectSymbol], String]

def unit[A](a: ⇒ A): scalap.Rule[S, S, A, Nothing]

def update(f: (S) ⇒ S): scalap.Rule[S, S, S, Nothing]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from MemoisableRules

Inherited from RulesWithState

Inherited from StateRules

Inherited from Rules

Inherited from AnyRef

Inherited from Any

Ungrouped