Packages

  • package root

    This is the documentation for Parsley.

    This is the documentation for Parsley.

    Package structure

    The parsley package contains the Parsley class, as well as the Result, Success, and Failure types. In addition to these, it also contains the following packages and "modules" (a module is defined as being an object which mocks a package):

    • parsley.Parsley contains the bulk of the core "function-style" combinators.
    • parsley.combinator contains many helpful combinators that simplify some common parser patterns.
    • parsley.character contains the combinators needed to read characters and strings, as well as combinators to match specific sub-sets of characters.
    • parsley.debug contains debugging combinators, helpful for identifying faults in parsers.
    • parsley.extension contains syntactic sugar combinators exposed as implicit classes.
    • parsley.expr contains the following sub modules:
      • parsley.expr.chain contains combinators used in expression parsing
      • parsley.expr.precedence is a builder for expression parsers built on a precedence table.
      • parsley.expr.infix contains combinators used in expression parsing, but with more permissive types than their equivalents in chain.
      • parsley.expr.mixed contains combinators that can be used for expression parsing, but where different fixities may be mixed on the same level: this is rare in practice.
    • parsley.implicits contains several implicits to add syntactic sugar to the combinators. These are sub-categorised into the following sub modules:
      • parsley.implicits.character contains implicits to allow you to use character and string literals as parsers.
      • parsley.implicits.combinator contains implicits related to combinators, such as the ability to make any parser into a Parsley[Unit] automatically.
      • parsley.implicits.lift enables postfix application of the lift combinator onto a function (or value).
      • parsley.implicits.zipped enables boths a reversed form of lift where the function appears on the right and is applied on a tuple (useful when type inference has failed) as well as a .zipped method for building tuples out of several combinators.
    • parsley.errors contains modules to deal with error messages, their refinement and generation.
    • parsley.lift contains functions which lift functions that work on regular types to those which now combine the results of parsers returning those same types. these are ubiquitous.
    • parsley.ap contains functions which allow for the application of a parser returning a function to several parsers returning each of the argument types.
    • parsley.registers contains combinators that interact with the context-sensitive functionality in the form of registers.
    • parsley.token contains the Lexer class that provides a host of helpful lexing combinators when provided with the description of a language.
    • parsley.position contains parsers for extracting position information.
    • parsley.genericbridges contains some basic implementations of the Parser Bridge pattern (see Design Patterns for Parser Combinators in Scala, or the parsley wiki): these can be used before more specialised generic bridge traits can be constructed.
    Definition Classes
    root
  • package parsley
    Definition Classes
    root
  • package errors

    This package contains various functionality relating to the generation and formatting of error messages.

    This package contains various functionality relating to the generation and formatting of error messages.

    In particular, it includes a collection of combinators for improving error messages within the parser, including labelling and providing additional information. It also contains combinators that can be used to valid data produced by a parser, to ensure it conforms to expected invariances, producing good quality error messages if this is not the case. Finally, this package contains ways of changing the formatting of error messages: this can either be changing how the default String-based errors are formatted, or by injectiing Parsley's errors into a custom error object.

    Definition Classes
    parsley
  • package expr

    This package contains various functionality relating to the parsing of expressions..

    This package contains various functionality relating to the parsing of expressions..

    This includes the "chain" combinators, which tackle the left-recursion problem and allow for the parsing and combining of operators with values. It also includes functionality for constructing larger precedence tables, which may even vary the type of each layer in the table, allowing for strongly-typed expression parsing.

    Definition Classes
    parsley
  • package implicits

    This package contains various functionality that involve Scala's implicits mechanism.

    This package contains various functionality that involve Scala's implicits mechanism.

    This includes conversions from scala literals into parsers, as well as enabling new syntax on regular Scala values (such as Parsley's lift or zipped syntax). Automatic conversion to Parsley[Unit] is also supported within this package.

    Definition Classes
    parsley
  • package internal
    Definition Classes
    parsley
  • package token

    This package provides a wealth of functionality for performing common lexing tasks.

    This package provides a wealth of functionality for performing common lexing tasks.

    It is organised as follows:

    • the main parsing functionality is accessed via Lexer, which provides implementations for the combinators found in the sub-packages given a LexicalDesc.
    • the descriptions sub-package is how a lexical structure can be described, providing the configuration that alters the behaviour of the parsers produced by the Lexer.
    • the other sub-packages contain the high-level interfaces that the Lexer exposes, which can be used to pass whitespace-aware and non-whitespace-aware combinators around in a uniform way.
    • the predicate module contains functionality to help define boolean predicates on characters or unicode codepoints.
    Definition Classes
    parsley
  • Failure
  • Parsley
  • Result
  • Success
  • ap
  • character
  • combinator
  • debug
  • extension
  • genericbridges
  • lift
  • position
  • registers
  • unicode

object ap

This module contains ap1 through ap22, which allow for the application of a parser returning a function of arity N to N parsers.

The combinators contained in this module all sequence a number of parsers together, but are capable of combining the results generated by these parsers into a single value with a function of the correct arity produced by the first parser. This is a clean way of putting together multiple parsers and getting a meaningful result out.

Source
ap.scala
Example: 

  1. scala> import parsley.character.char
scala> import parsley.ap.{ap2, ap3}
scala> case class Add(x: Int, y: Int)
scala> val p = ap2(pure(Add), char('a').as(4), char('b').as(5))
scala> p.parse("ab")
val res0 = Success(Add(4, 5))
scala> val q = ap3(pure((x: Int, y: Int, z: Int) => x * y + z), char('a').as(3), char('b').as(2), char('c').as(5))
scala> q.parse("abc")
val res1 = Success(11)
scala> q.parse("ab")
val res2 = Failure(..)
Since

4.0.0

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ap
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def ap1[T1, R](pf: Parsley[(T1) ⇒ R], p1: ⇒ Parsley[T1]): Parsley[R]

    This combinator allows the function that results from one parser to be applied to the result of another parser.

    This combinator allows the function that results from one parser to be applied to the result of another parser.

    Effectively alias for <*>, to be consistent with the other ap variants.

    pf

    the parser whose result is a function to map across the result of p1.

    returns

    a parser that applies the function f resulting from pf to the result x of the parser p1.

  5. def ap10[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, R](pf: Parsley[(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10) ⇒ R], p1: ⇒ Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6], p7: ⇒ Parsley[T7], p8: ⇒ Parsley[T8], p9: ⇒ Parsley[T9], p10: ⇒ Parsley[T10]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    pf

    a parser that returns a function to apply to the results of the parsers with arity ten.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  6. def ap11[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, R](pf: Parsley[(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11) ⇒ R], p1: ⇒ Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6], p7: ⇒ Parsley[T7], p8: ⇒ Parsley[T8], p9: ⇒ Parsley[T9], p10: ⇒ Parsley[T10], p11: ⇒ Parsley[T11]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    pf

    a parser that returns a function to apply to the results of the parsers with arity eleven.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  7. def ap12[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, R](pf: Parsley[(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12) ⇒ R], p1: ⇒ Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6], p7: ⇒ Parsley[T7], p8: ⇒ Parsley[T8], p9: ⇒ Parsley[T9], p10: ⇒ Parsley[T10], p11: ⇒ Parsley[T11], p12: ⇒ Parsley[T12]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    pf

    a parser that returns a function to apply to the results of the parsers with arity twelve.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  8. def ap13[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, R](pf: Parsley[(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13) ⇒ R], p1: ⇒ Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6], p7: ⇒ Parsley[T7], p8: ⇒ Parsley[T8], p9: ⇒ Parsley[T9], p10: ⇒ Parsley[T10], p11: ⇒ Parsley[T11], p12: ⇒ Parsley[T12], p13: ⇒ Parsley[T13]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    pf

    a parser that returns a function to apply to the results of the parsers with arity thirteen.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  9. def ap14[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, R](pf: Parsley[(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14) ⇒ R], p1: ⇒ Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6], p7: ⇒ Parsley[T7], p8: ⇒ Parsley[T8], p9: ⇒ Parsley[T9], p10: ⇒ Parsley[T10], p11: ⇒ Parsley[T11], p12: ⇒ Parsley[T12], p13: ⇒ Parsley[T13], p14: ⇒ Parsley[T14]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    pf

    a parser that returns a function to apply to the results of the parsers with arity fourteen.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  10. def ap15[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, R](pf: Parsley[(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15) ⇒ R], p1: ⇒ Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6], p7: ⇒ Parsley[T7], p8: ⇒ Parsley[T8], p9: ⇒ Parsley[T9], p10: ⇒ Parsley[T10], p11: ⇒ Parsley[T11], p12: ⇒ Parsley[T12], p13: ⇒ Parsley[T13], p14: ⇒ Parsley[T14], p15: ⇒ Parsley[T15]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    pf

    a parser that returns a function to apply to the results of the parsers with arity fifteen.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  11. def ap16[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, R](pf: Parsley[(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16) ⇒ R], p1: ⇒ Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6], p7: ⇒ Parsley[T7], p8: ⇒ Parsley[T8], p9: ⇒ Parsley[T9], p10: ⇒ Parsley[T10], p11: ⇒ Parsley[T11], p12: ⇒ Parsley[T12], p13: ⇒ Parsley[T13], p14: ⇒ Parsley[T14], p15: ⇒ Parsley[T15], p16: ⇒ Parsley[T16]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    pf

    a parser that returns a function to apply to the results of the parsers with arity sixteen.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  12. def ap17[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, R](pf: Parsley[(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17) ⇒ R], p1: ⇒ Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6], p7: ⇒ Parsley[T7], p8: ⇒ Parsley[T8], p9: ⇒ Parsley[T9], p10: ⇒ Parsley[T10], p11: ⇒ Parsley[T11], p12: ⇒ Parsley[T12], p13: ⇒ Parsley[T13], p14: ⇒ Parsley[T14], p15: ⇒ Parsley[T15], p16: ⇒ Parsley[T16], p17: ⇒ Parsley[T17]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    pf

    a parser that returns a function to apply to the results of the parsers with arity seventeen.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  13. def ap18[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, R](pf: Parsley[(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18) ⇒ R], p1: ⇒ Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6], p7: ⇒ Parsley[T7], p8: ⇒ Parsley[T8], p9: ⇒ Parsley[T9], p10: ⇒ Parsley[T10], p11: ⇒ Parsley[T11], p12: ⇒ Parsley[T12], p13: ⇒ Parsley[T13], p14: ⇒ Parsley[T14], p15: ⇒ Parsley[T15], p16: ⇒ Parsley[T16], p17: ⇒ Parsley[T17], p18: ⇒ Parsley[T18]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    pf

    a parser that returns a function to apply to the results of the parsers with arity eighteen.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  14. def ap19[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, R](pf: Parsley[(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19) ⇒ R], p1: ⇒ Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6], p7: ⇒ Parsley[T7], p8: ⇒ Parsley[T8], p9: ⇒ Parsley[T9], p10: ⇒ Parsley[T10], p11: ⇒ Parsley[T11], p12: ⇒ Parsley[T12], p13: ⇒ Parsley[T13], p14: ⇒ Parsley[T14], p15: ⇒ Parsley[T15], p16: ⇒ Parsley[T16], p17: ⇒ Parsley[T17], p18: ⇒ Parsley[T18], p19: ⇒ Parsley[T19]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    pf

    a parser that returns a function to apply to the results of the parsers with arity nineteen.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  15. def ap2[T1, T2, R](pf: Parsley[(T1, T2) ⇒ R], p1: ⇒ Parsley[T1], p2: ⇒ Parsley[T2]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    pf

    a parser that returns a function to apply to the results of the parsers with arity two.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  16. def ap20[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, T20, R](pf: Parsley[(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, T20) ⇒ R], p1: ⇒ Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6], p7: ⇒ Parsley[T7], p8: ⇒ Parsley[T8], p9: ⇒ Parsley[T9], p10: ⇒ Parsley[T10], p11: ⇒ Parsley[T11], p12: ⇒ Parsley[T12], p13: ⇒ Parsley[T13], p14: ⇒ Parsley[T14], p15: ⇒ Parsley[T15], p16: ⇒ Parsley[T16], p17: ⇒ Parsley[T17], p18: ⇒ Parsley[T18], p19: ⇒ Parsley[T19], p20: ⇒ Parsley[T20]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    pf

    a parser that returns a function to apply to the results of the parsers with arity twenty.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  17. def ap21[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, T20, T21, R](pf: Parsley[(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, T20, T21) ⇒ R], p1: ⇒ Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6], p7: ⇒ Parsley[T7], p8: ⇒ Parsley[T8], p9: ⇒ Parsley[T9], p10: ⇒ Parsley[T10], p11: ⇒ Parsley[T11], p12: ⇒ Parsley[T12], p13: ⇒ Parsley[T13], p14: ⇒ Parsley[T14], p15: ⇒ Parsley[T15], p16: ⇒ Parsley[T16], p17: ⇒ Parsley[T17], p18: ⇒ Parsley[T18], p19: ⇒ Parsley[T19], p20: ⇒ Parsley[T20], p21: ⇒ Parsley[T21]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    pf

    a parser that returns a function to apply to the results of the parsers with arity twenty-one.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  18. def ap22[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, T20, T21, T22, R](pf: Parsley[(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, T20, T21, T22) ⇒ R], p1: ⇒ Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6], p7: ⇒ Parsley[T7], p8: ⇒ Parsley[T8], p9: ⇒ Parsley[T9], p10: ⇒ Parsley[T10], p11: ⇒ Parsley[T11], p12: ⇒ Parsley[T12], p13: ⇒ Parsley[T13], p14: ⇒ Parsley[T14], p15: ⇒ Parsley[T15], p16: ⇒ Parsley[T16], p17: ⇒ Parsley[T17], p18: ⇒ Parsley[T18], p19: ⇒ Parsley[T19], p20: ⇒ Parsley[T20], p21: ⇒ Parsley[T21], p22: ⇒ Parsley[T22]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    pf

    a parser that returns a function to apply to the results of the parsers with arity twenty-two.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  19. def ap3[T1, T2, T3, R](pf: Parsley[(T1, T2, T3) ⇒ R], p1: ⇒ Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    pf

    a parser that returns a function to apply to the results of the parsers with arity three.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  20. def ap4[T1, T2, T3, T4, R](pf: Parsley[(T1, T2, T3, T4) ⇒ R], p1: ⇒ Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    pf

    a parser that returns a function to apply to the results of the parsers with arity four.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  21. def ap5[T1, T2, T3, T4, T5, R](pf: Parsley[(T1, T2, T3, T4, T5) ⇒ R], p1: ⇒ Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    pf

    a parser that returns a function to apply to the results of the parsers with arity five.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  22. def ap6[T1, T2, T3, T4, T5, T6, R](pf: Parsley[(T1, T2, T3, T4, T5, T6) ⇒ R], p1: ⇒ Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    pf

    a parser that returns a function to apply to the results of the parsers with arity six.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  23. def ap7[T1, T2, T3, T4, T5, T6, T7, R](pf: Parsley[(T1, T2, T3, T4, T5, T6, T7) ⇒ R], p1: ⇒ Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6], p7: ⇒ Parsley[T7]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    pf

    a parser that returns a function to apply to the results of the parsers with arity seven.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  24. def ap8[T1, T2, T3, T4, T5, T6, T7, T8, R](pf: Parsley[(T1, T2, T3, T4, T5, T6, T7, T8) ⇒ R], p1: ⇒ Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6], p7: ⇒ Parsley[T7], p8: ⇒ Parsley[T8]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    pf

    a parser that returns a function to apply to the results of the parsers with arity eight.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  25. def ap9[T1, T2, T3, T4, T5, T6, T7, T8, T9, R](pf: Parsley[(T1, T2, T3, T4, T5, T6, T7, T8, T9) ⇒ R], p1: ⇒ Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6], p7: ⇒ Parsley[T7], p8: ⇒ Parsley[T8], p9: ⇒ Parsley[T9]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

    Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    pf

    a parser that returns a function to apply to the results of the parsers with arity nine.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  26. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  27. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  28. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  29. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  30. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  31. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  32. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  33. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  34. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  35. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  36. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  37. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  38. def toString(): String
    Definition Classes
    AnyRef → Any
  39. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  40. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  41. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()

Inherited from AnyRef

Inherited from Any

Ungrouped