object chain
This module contains the very useful chaining family of combinators, which are mostly used to parse operators and expressions of varying fixities. It is a more low-level API compared with precedence.
- Since
2.2.0
- Alphabetic
- By Inheritance
- chain
- 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 left[A, B](p: => Parsley[A], op: => Parsley[(B, A) => B], x: B)(implicit wrap: (A) => B): Parsley[B]
left(p, op, x)
parses *zero* or more occurrences ofp
, separated byop
.left(p, op, x)
parses *zero* or more occurrences ofp
, separated byop
. Returns a value obtained by a left associative application of all functions returned byop
to the values returned byp
. If there are no occurrences ofp
, the valuex
is returned.- Since
2.2.0
- def left1[A, B](p: => Parsley[A], op: => Parsley[(B, A) => B])(implicit wrap: (A) => B): Parsley[B]
left1(p, op) parses *one* or more occurrences of
p
, separated byop
.left1(p, op) parses *one* or more occurrences of
p
, separated byop
. Returns a value obtained by a left associative application of all functions return byop
to the values returned byp
. This parser can for example be used to eliminate left recursion which typically occurs in expression grammars.- Since
2.2.0
- 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()
- def postfix[A](p: => Parsley[A], op: => Parsley[(A) => A]): Parsley[A]
postfix(p, op)
parses one occurrence ofp
, followed by many postfix applications ofop
that associate to the left.postfix(p, op)
parses one occurrence ofp
, followed by many postfix applications ofop
that associate to the left.- Since
2.2.0
- def postfix1[A, B <: A](p: => Parsley[A], op: => Parsley[(A) => B]): Parsley[B]
postfix1(p, op)
parses one occurrence ofp
, followed by one or more postfix applications ofop
that associate to the left.postfix1(p, op)
parses one occurrence ofp
, followed by one or more postfix applications ofop
that associate to the left.- Since
3.0.0
- def prefix[A](op: => Parsley[(A) => A], p: => Parsley[A]): Parsley[A]
prefix(op, p)
parses many prefixed applications ofop
onto a single final result ofp
prefix(op, p)
parses many prefixed applications ofop
onto a single final result ofp
- Since
2.2.0
- def prefix1[A, B <: A](op: => Parsley[(A) => B], p: => Parsley[A]): Parsley[B]
prefix1(op, p)
parses one or more prefixed applications ofop
onto a single final result ofp
prefix1(op, p)
parses one or more prefixed applications ofop
onto a single final result ofp
- Since
3.0.0
- def right[A, B](p: => Parsley[A], op: => Parsley[(A, B) => B], x: B)(implicit wrap: (A) => B): Parsley[B]
right(p, op, x)
parses *zero* or more occurrences ofp
, separated byop
.right(p, op, x)
parses *zero* or more occurrences ofp
, separated byop
. Returns a value obtained by a right associative application of all functions return byop
to the values returned byp
. If there are no occurrences ofp
, the valuex
is returned.- Since
2.2.0
- def right1[A, B](p: => Parsley[A], op: => Parsley[(A, B) => B])(implicit wrap: (A) => B): Parsley[B]
right1(p, op)
parses *one* or more occurrences ofp
, separated byop
.right1(p, op)
parses *one* or more occurrences ofp
, separated byop
. Returns a value obtained by a right associative application of all functions return byop
to the values returned byp
.- Since
2.2.0
- 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, as well as the implicit classes which enable the "method-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.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.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.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.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.unsafe
contains unsafe (and not thread-safe) ways of speeding up the execution of a parser.