molecule.parsing

Parsers

trait Parsers[Elem] extends AnyRef

Shameless rip of Scala parsers trait

Elem is the type of input elements the provided parsers consume

Source
Parsers.scala
Linear Supertypes
AnyRef, Any
Known Subclasses
RegexParsers
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. Parsers
  2. AnyRef
  3. Any
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

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

    The parser that matches an element in the domain of the partial function f'

    The parser that matches an element in the domain of the partial function f'

    If f' is defined on the first element in the input, f' is applied to it to produce this parser's result.

    Example: The parser accept("name", {case Identifier(n) => Name(n)}) accepts an Identifier(n) and returns a Name(n).

    expected

    a description of the kind of element this parser expects (for error messages)

    f

    a partial function that determines when this parser is successful and what its output is

    returns

    A parser that succeeds if f' is applicable to the first element of the input, applying f' to it to produce the result.

  7. def accept[ES](es: ES)(implicit arg0: (ES) ⇒ List[Elem]): Parser[Elem, Seg[Elem]]

    A parser that matches only the given list of element es'

    A parser that matches only the given list of element es'

    accept(es) succeeds if the input subsequently provides the elements in the list es'.

    es

    the list of expected elements

    returns

    a Parser that recognizes a specified list of elements

  8. implicit def accept(e: Elem): Parser[Elem, Elem]

    A parser that matches only the given element e'

    A parser that matches only the given element e'

    The method is implicit so that elements can automatically be lifted to their parsers. For example, when parsing Token's, Identifier("new") (which is a Token') can be used directly, instead of first creating a Parser' using accept(Identifier("new")).

    e

    the Elem' that must be the next piece of input for the returned parser to succeed

    returns

    a tParser' that succeeds if e' is the next available input.

  9. def acceptAny: Parser[Elem, Elem]

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

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

  12. def acceptSeq[ES](es: ES)(implicit arg0: (ES) ⇒ Iterable[Elem]): Parser[Elem, Seg[Elem]]

  13. def acceptSignal(signal: Signal): Parser[Elem, Nothing]

  14. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  15. def clone(): AnyRef

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()

  16. def elem(e: Elem): Parser[Elem, Elem]

    A parser that matches only the given element e'

    A parser that matches only the given element e'

    The method is implicit so that elements can automatically be lifted to their parsers. For example, when parsing Token's, Identifier("new") (which is a Token') can be used directly, instead of first creating a Parser' using accept(Identifier("new")).

    e

    the Elem' that must be the next piece of input for the returned parser to succeed

    returns

    a Parser' that succeeds if e' is the next available input.

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

    A parser matching input elements that satisfy a given predicate

    A parser matching input elements that satisfy a given predicate

    elem(kind, p) succeeds if the input starts with an element e' for which p(e) is true.

    kind

    The element kind, used for error messages

    p

    A predicate that determines which elements match. @return

  18. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  19. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  20. def fail(msg: ⇒ String): Parser[Elem, Nothing]

    A parser that results in a parse failure

    A parser that results in a parse failure

    msg

    The error message describing the failure.

    returns

    A parser to Nothing that always generates a Fail result.

  21. def finalize(): Unit

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef → Any

  23. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  24. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  25. def log[T](p: ⇒ Parser[Elem, T])(name: String): Parser[Elem, T]

    Log interactions with this parser

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

  27. def mkSeg[T]: (~[T, Seg[T]]) ⇒ Seg[T]

  28. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  29. final def notify(): Unit

    Definition Classes
    AnyRef

  30. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  31. def opt[T](p: ⇒ Parser[Elem, T]): Parser[Elem, Option[T]]

    A parser generator for optional sub-phrases.

    A parser generator for optional sub-phrases.

    opt(p) is a parser that returns Some(x)' if p' returns x' and None' if p' fails

    p

    A Parser' that is tried on the input

    returns

    a Parser' that always succeeds: either with the result provided by p' or with the empty result

  32. implicit def parsers: Parsers[Elem]

  33. def rep[T](p: ⇒ Parser[Elem, T]): Parser[Elem, Seg[T]]

    A parser generator for repetitions.

    A parser generator for repetitions.

    rep(p) repeatedly uses p' to parse the input until p' fails (the result is a List of the consecutive results of p')

    p

    a Parser' that is to be applied successively to the input

    returns

    A parser that returns a list of results produced by repeatedly applying p' to the input.

  34. def rep1[T](first: ⇒ Parser[Elem, T], next: ⇒ Parser[Elem, T]): Parser[Elem, Seg[T]]

    A parser generator for non-empty repetitions.

    A parser generator for non-empty repetitions.

    rep1(f, p) first uses f' (which must succeed) and then repeatedly uses p' to parse the input until p' fails (the result is a List' of the consecutive results of f' and p')

    first

    a Parser' that parses the first piece of input

    next

    a Parser' that is to be applied successively to the rest of the input (if any)

    returns

    A parser that returns a list of results produced by first applying f' and then repeatedly p' to the input (it only succeeds if f' matches).

  35. def rep1[T](p: ⇒ Parser[Elem, T]): Parser[Elem, Seg[T]]

    A parser generator for non-empty repetitions.

    A parser generator for non-empty repetitions.

    rep1(p) repeatedly uses p' to parse the input until p' fails -- p' must succeed at least once (the result is a List' of the consecutive results of p')

    p

    a Parser' that is to be applied successively to the input

    returns

    A parser that returns a list of results produced by repeatedly applying p' to the input (and that only succeeds if p' matches at least once).

  36. def rep1sep[T](p: ⇒ Parser[Elem, T], q: ⇒ Parser[Elem, Any]): Parser[Elem, Seg[T]]

    A parser generator for non-empty repetitions.

    A parser generator for non-empty repetitions.

    rep1sep(p, q) repeatedly applies p' interleaved with q' to parse the input, until p' fails. The parser p' must succeed at least once.

    p

    a Parser' that is to be applied successively to the input

    q

    a Parser' that parses the elements that separate the elements parsed by p' (interleaved with q')

    returns

    A parser that returns a list of results produced by repeatedly applying p' to the input (and that only succeeds if p' matches at least once). The results of p' are collected in a list. The results of q' are discarded.

  37. def repN[T](num: Int, p: ⇒ Parser[Elem, T]): Parser[Elem, Seg[T]]

    A parser generator for a specified number of repetitions.

    A parser generator for a specified number of repetitions.

    repN(n, p) uses p' exactly n' time to parse the input (the result is a List' of the n' consecutive results of p')

    p

    a Parser' that is to be applied successively to the input

    returns

    A parser that returns a list of results produced by repeatedly applying p' to the input (and that only succeeds if p' matches exactly n' times).

  38. def repsep[T](p: ⇒ Parser[Elem, T], q: ⇒ Parser[Elem, Any]): Parser[Elem, Seg[T]]

    A parser generator for interleaved repetitions.

    A parser generator for interleaved repetitions.

    repsep(p, q) repeatedly uses p' interleaved with q' to parse the input, until p' fails. (The result is a List' of the results of p'.)

    Example: repsep(term, ",") parses a comma-separated list of term's, yielding a list of these terms

    p

    a Parser' that is to be applied successively to the input

    q

    a Parser' that parses the elements that separate the elements parsed by p'

    returns

    A parser that returns a list of results produced by repeatedly applying p' (interleaved with q') to the input. The results of p' are collected in a list. The results of q' are discarded.

  39. def success[T](v: T): Parser[Elem, T] { ... /* 2 definitions in type refinement */ }

    A parser that always succeeds

    A parser that always succeeds

    v

    The result for the parser

    returns

    A parser that always succeeds, with the given result v'

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

    Definition Classes
    AnyRef

  41. def toString(): String

    Definition Classes
    AnyRef → Any

  42. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

  44. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

Deprecated Value Members

  1. def err(msg: ⇒ String): Parser[Elem, Elem]

    A parser that results in an error

    A parser that results in an error

    msg

    The error message describing the failure.

    returns

    A parser that always fails with the specified error message.

    Annotations
    @deprecated
    Deprecated

    (Since version r95) Use fail(msg: => String): Parser[ByteBuffer, Nothing] in stead. Not to be confused with scala.Predef.error(msg:String):Nothing or sys.error(msg:String):Nothing, which will generate a runtime error

Inherited from AnyRef

Inherited from Any