object enclosing
This object contains helper combinators for parsing terms enclosed by common symbols.
- Source
- Lexer.scala
- Since
4.0.0
- Alphabetic
- By Inheritance
- enclosing
- 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
- def angles[A](p: => Parsley[A]): Parsley[A]
This combinator parses a
p
enclosed within angle brackets.This combinator parses a
p
enclosed within angle brackets.First parse an open bracket, any whitespace, then parse,
p
, producingx
. Finally, parse a closing bracket and any whitespace. If all three parts succeeded, then returnx
. If any of them failed, this combinator fails.- p
the parser to parse between parentheses.
- returns
a parser that reads an open bracket, then
p
, then a closing bracket and returns the result ofp
.
scala> ... scala> val p = lexer.nonlexeme.enclosing.brackets(int) scala> p.parse("< 5>") val res0 = Success(5) scala> p.parse("<5") val res1 = Failure(...) scala> p.parse("5>") val res2 = Failure(...)
- Since
4.0.0
Example: - final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def braces[A](p: => Parsley[A]): Parsley[A]
This combinator parses a
p
enclosed within braces.This combinator parses a
p
enclosed within braces.First parse an open brace, any whitespace, then parse,
p
, producingx
. Finally, parse a closing brace and any whitespace. If all three parts succeeded, then returnx
. If any of them failed, this combinator fails.- p
the parser to parse between parentheses.
- returns
a parser that reads an open brace, then
p
, then a closing brace and returns the result ofp
.
scala> ... scala> val p = lexer.nonlexeme.enclosing.braces(int) scala> p.parse("{ 5}") val res0 = Success(5) scala> p.parse("{5") val res1 = Failure(...) scala> p.parse("5}") val res2 = Failure(...)
- Since
4.0.0
Example: - def brackets[A](p: => Parsley[A]): Parsley[A]
This combinator parses a
p
enclosed within square brackets.This combinator parses a
p
enclosed within square brackets.First parse an open bracket, any whitespace, then parse,
p
, producingx
. Finally, parse a closing bracket and any whitespace. If all three parts succeeded, then returnx
. If any of them failed, this combinator fails.- p
the parser to parse between parentheses.
- returns
a parser that reads an open bracket, then
p
, then a closing bracket and returns the result ofp
.
scala> ... scala> val p = lexer.nonlexeme.enclosing.brackets(int) scala> p.parse("[ 5]") val res0 = Success(5) scala> p.parse("[5") val res1 = Failure(...) scala> p.parse("5]") val res2 = Failure(...)
- Since
4.0.0
Example: - 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
- 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 parens[A](p: => Parsley[A]): Parsley[A]
This combinator parses a
p
enclosed within parentheses.This combinator parses a
p
enclosed within parentheses.First parse an open parenthesis, any whitespace, then parse,
p
, producingx
. Finally, parse a closing parenthesis and any whitespace. If all three parts succeeded, then returnx
. If any of them failed, this combinator fails.- p
the parser to parse between parentheses.
- returns
a parser that reads an open parenthesis, then
p
, then a closing parenthesis and returns the result ofp
.
scala> ... scala> val p = lexer.nonlexeme.enclosing.parens(int) scala> p.parse("( 5)") val res0 = Success(5) scala> p.parse("(5") val res1 = Failure(...) scala> p.parse("5)") val res2 = Failure(...)
- Since
4.0.0
Example: - 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.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.