Packages

  • package root
    Definition Classes
    root
  • package parsley
    Definition Classes
    root
  • 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
  • Atoms
  • Fixity
  • GOps
  • InfixL
  • InfixN
  • InfixR
  • Ops
  • Postfix
  • Prec
  • Prefix
  • SOps
  • chain
  • infix
  • mixed
  • precedence

object mixed

This module contains specialist combinators for mixing unary and binary operators on the same level. This is only sensible when mixing infix-left and postfix or infix-right and prefix.

Source
mixed.scala
Since

4.0.0

Note

the behaviour of the enclosed combinators may be counter intuitive: they should not be used unless you know what you are doing.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. mixed
  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. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  6. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  7. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  9. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  10. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  11. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  12. def left1[A, B, C >: B](p: Parsley[A], uop: ⇒ Parsley[(C) ⇒ C], bop: ⇒ Parsley[(C, A) ⇒ B])(implicit wrap: (A) ⇒ C): Parsley[C]

    This combinator handles left-associative parsing, and application of, zero or more binary operators and postfix unary operators between/before one or more values.

    This combinator handles left-associative parsing, and application of, zero or more binary operators and postfix unary operators between/before one or more values.

    First parse p, then parse either a uop or an op followed by a p, repeatedly. The results of the ps, x1 through xn, are combined with the results of the bops, f1 through fn-1, and the uops, g1,1 through gm,i, with left-associative application: gm,i(gm,i-1(..gm,1(fn-1(..f1(g1,j(..g1,1(x1)..)), .. . This application is then returned as the result of the combinator. If p, uop, or bop fails having consumed input at any point, the whole combinator fails.

    A

    the type of the values.

    B

    the type returned by the operator, which must be a subtype of the result type C.

    C

    the result type of the chain, which also fits into the recursive application site of the operators.

    p

    the value to be parsed.

    uop

    the operator before each binary application.

    bop

    the operator between each value.

    wrap

    a function that can convert the value type into the result type, this is provided automatically when A <:< C.

    returns

    a parser that parses alternating p, uop, and bop, ending in a p and applies their results left-associatively.

    Example: 

    1. scala> import parsley.expr.mixed, parsley.character.{digit, char}
scala> sealed trait Expr
scala> case class B(l: Expr, r: C) extends Expr
scala> case class U(c: Expr) extends Expr
scala> case class C(x: Char) extends Expr
scala> val p = mixed.left1(digit.map(Constant), char('?') #> U, char('+') #> B)
scala> p.parse("1?+2+3??")
val res0 = Success(U(U(B(B(U(C('1')), C('2')), C('3')))))
    Since

    4.0.0

    Note

    if you know this is what you are looking for, you have found it: otherwise, this is not what you are looking for.

  13. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  14. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  15. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  16. def right1[A, B, C >: B](p: Parsley[A], uop: Parsley[(C) ⇒ C], bop: ⇒ Parsley[(A, C) ⇒ B])(implicit wrap: (A) ⇒ C): Parsley[C]

    This combinator handles right-associative parsing, and application of, zero or more binary operators and prefix unary operators between/before one or more values.

    This combinator handles right-associative parsing, and application of, zero or more binary operators and prefix unary operators between/before one or more values.

    First parse p, then parse either a uop or an op followed by a p, repeatedly. The results of the ps, x1 through xn, are combined with the results of the bops, f1 through fn-1, and the uops, g1,1 through gm,i, with right-associative application: g1,1(g1,2(..g1,i(f1(x1, g2,1(..g2,j(f2(x2,.. . This application is then returned as the result of the combinator. If p, uop, or bop fails having consumed input at any point, the whole combinator fails.

    A

    the type of the values.

    B

    the type returned by the operator, which must be a subtype of the result type C.

    C

    the result type of the chain, which also fits into the recursive application site of the operators.

    p

    the value to be parsed.

    uop

    the operator before each binary application.

    bop

    the operator between each value.

    wrap

    a function that can convert the value type into the result type, this is provided automatically when A <:< C.

    returns

    a parser that parses alternating p, uop, and bop, ending in a p and applies their results right-associatively.

    Example: 

    1. scala> import parsley.expr.mixed, parsley.character.{digit, char}
scala> sealed trait Expr
scala> case class B(l: C, r: Expr) extends Expr
scala> case class U(c: Expr) extends Expr
scala> case class C(x: Char) extends Expr
scala> val p = mixed.right1(digit.map(C), char('-') #> U, char('+') #> B)
scala> p.parse("-1+--2+3")
val res0 = Success(U(B(C('1'), U(U(B(C('2'), C('3')))))))
    Since

    4.0.0

    Note

    if you know this is what you are looking for, you have found it: otherwise, this is not what you are looking for.

  17. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  18. def toString(): String
    Definition Classes
    AnyRef → Any
  19. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  20. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  21. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()

Inherited from AnyRef

Inherited from Any

Ungrouped