object lift
This module contains lift1
through lift22
, which allow for the application of 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 given function of the correct arity. This is a clean way of putting together multiple parsers and getting a meaningful result out.
- Source
- lift.scala
scala> import parsley.character.char scala> import parsley.lift.{lift2, lift3} scala> case class Add(x: Int, y: Int) scala> val p = lift2(Add, char('a') #> 4, char('b') #> 5) scala> p.parse("ab") val res0 = Success(Add(4, 5)) scala> val q = lift3((x: Int, y: Int, z: Int) => x * y + z, char('a') #> 3, char('b') #> 2, char('c') #> 5) scala> q.parse("abc") val res1 = Success(11) scala> q.parse("ab") val res2 = Failure(..) scala> val q2 = lift3[Int, Int, Int, Int](_ * _ + _, char('a') #> 3, char('b') #> 2, char('c') #> 5)
- Since
2.2.0
- Alphabetic
- By Inheritance
- lift
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
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
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def lift1[T1, R](f: (T1) => R, p1: Parsley[T1]): Parsley[R]
This combinator allows the result of a given parser to be changed using a given function.
This combinator allows the result of a given parser to be changed using a given function.
Effectively alias for
map
, to be consistent with the otherlift
variants.- f
the function to map across the given parser
- returns
a parser that applies the function
f
to the result of the given parser.
- def lift10[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, R](f: (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 given function
f
of to all of the results.This combinator applies the given parsers in sequence and then applies the given function
f
of to all of the results.Firstly, each parser is parsed in turn, each producing a result. 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.- f
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
.
- def lift11[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, R](f: (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 given function
f
of to all of the results.This combinator applies the given parsers in sequence and then applies the given function
f
of to all of the results.Firstly, each parser is parsed in turn, each producing a result. 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.- f
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
.
- def lift12[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, R](f: (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 given function
f
of to all of the results.This combinator applies the given parsers in sequence and then applies the given function
f
of to all of the results.Firstly, each parser is parsed in turn, each producing a result. 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.- f
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
.
- def lift13[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, R](f: (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 given function
f
of to all of the results.This combinator applies the given parsers in sequence and then applies the given function
f
of to all of the results.Firstly, each parser is parsed in turn, each producing a result. 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.- f
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
.
- def lift14[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, R](f: (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 given function
f
of to all of the results.This combinator applies the given parsers in sequence and then applies the given function
f
of to all of the results.Firstly, each parser is parsed in turn, each producing a result. 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.- f
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
.
- def lift15[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, R](f: (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 given function
f
of to all of the results.This combinator applies the given parsers in sequence and then applies the given function
f
of to all of the results.Firstly, each parser is parsed in turn, each producing a result. 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.- f
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
.
- def lift16[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, R](f: (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 given function
f
of to all of the results.This combinator applies the given parsers in sequence and then applies the given function
f
of to all of the results.Firstly, each parser is parsed in turn, each producing a result. 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.- f
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
.
- def lift17[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, R](f: (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 given function
f
of to all of the results.This combinator applies the given parsers in sequence and then applies the given function
f
of to all of the results.Firstly, each parser is parsed in turn, each producing a result. 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.- f
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
.
- def lift18[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, R](f: (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 given function
f
of to all of the results.This combinator applies the given parsers in sequence and then applies the given function
f
of to all of the results.Firstly, each parser is parsed in turn, each producing a result. 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.- f
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
.
- def lift19[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, R](f: (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 given function
f
of to all of the results.This combinator applies the given parsers in sequence and then applies the given function
f
of to all of the results.Firstly, each parser is parsed in turn, each producing a result. 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.- f
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
.
- def lift2[T1, T2, R](f: (T1, T2) => R, p1: Parsley[T1], p2: => Parsley[T2]): Parsley[R]
This combinator applies the given parsers in sequence and then applies the given function
f
of to all of the results.This combinator applies the given parsers in sequence and then applies the given function
f
of to all of the results.Firstly, each parser is parsed in turn, each producing a result. 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.- f
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
.
- def lift20[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, T20, R](f: (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 given function
f
of to all of the results.This combinator applies the given parsers in sequence and then applies the given function
f
of to all of the results.Firstly, each parser is parsed in turn, each producing a result. 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.- f
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
.
- def lift21[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, T20, T21, R](f: (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 given function
f
of to all of the results.This combinator applies the given parsers in sequence and then applies the given function
f
of to all of the results.Firstly, each parser is parsed in turn, each producing a result. 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.- f
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
.
- def lift22[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, T20, T21, T22, R](f: (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 given function
f
of to all of the results.This combinator applies the given parsers in sequence and then applies the given function
f
of to all of the results.Firstly, each parser is parsed in turn, each producing a result. 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.- f
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
.
- def lift3[T1, T2, T3, R](f: (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 given function
f
of to all of the results.This combinator applies the given parsers in sequence and then applies the given function
f
of to all of the results.Firstly, each parser is parsed in turn, each producing a result. 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.- f
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
.
- def lift4[T1, T2, T3, T4, R](f: (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 given function
f
of to all of the results.This combinator applies the given parsers in sequence and then applies the given function
f
of to all of the results.Firstly, each parser is parsed in turn, each producing a result. 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.- f
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
.
- def lift5[T1, T2, T3, T4, T5, R](f: (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 given function
f
of to all of the results.This combinator applies the given parsers in sequence and then applies the given function
f
of to all of the results.Firstly, each parser is parsed in turn, each producing a result. 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.- f
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
.
- def lift6[T1, T2, T3, T4, T5, T6, R](f: (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 given function
f
of to all of the results.This combinator applies the given parsers in sequence and then applies the given function
f
of to all of the results.Firstly, each parser is parsed in turn, each producing a result. 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.- f
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
.
- def lift7[T1, T2, T3, T4, T5, T6, T7, R](f: (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 given function
f
of to all of the results.This combinator applies the given parsers in sequence and then applies the given function
f
of to all of the results.Firstly, each parser is parsed in turn, each producing a result. 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.- f
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
.
- def lift8[T1, T2, T3, T4, T5, T6, T7, T8, R](f: (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 given function
f
of to all of the results.This combinator applies the given parsers in sequence and then applies the given function
f
of to all of the results.Firstly, each parser is parsed in turn, each producing a result. 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.- f
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
.
- def lift9[T1, T2, T3, T4, T5, T6, T7, T8, T9, R](f: (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 given function
f
of to all of the results.This combinator applies the given parsers in sequence and then applies the given function
f
of to all of the results.Firstly, each parser is parsed in turn, each producing a result. 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.- f
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
.
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
This is the documentation for Parsley.
Package structure
The parsley package contains the
Parsley
class, as well as theResult
,Success
, andFailure
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.io
contains extension methods to run parsers with input sourced from IO sources.parsley.expr
contains the following sub modules:parsley.expr.chain
contains combinators used in expression parsingparsley.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 inchain
.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 aParsley[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.errors.combinator
provides combinators that can be used to either produce more detailed errors as well as refine existing errors.parsley.errors.tokenextractors
provides mixins for common token extraction strategies during error message generation: these can be used to avoid implementingunexpectedToken
in theErrorBuilder
.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 theLexer
class that provides a host of helpful lexing combinators when provided with the description of a language.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.