case class Atoms[+A](atom0: Parsley[A], atoms: Parsley[A]*) extends Prec[A] with Product with Serializable
This class is the base of a precedence table.
Forms the base of a precedence table, requiring at least one atom to be provided. This first atom will be parsed first.
- A
the type of the atoms.
- atom0
the first atom found at the root of the precedence table.
- atoms
any remaining atoms found at the root of the precedence table.
- Source
- Levels.scala
- Since
4.0.0
- Alphabetic
- By Inheritance
- Atoms
- Serializable
- Serializable
- Product
- Equals
- Prec
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
+:[Aʹ >: A, B](ops: Ops[Aʹ, B]): Prec[B]
This method adds a new layer to this precedence table on the left, in a weakest-to-tightest ordering.
This method adds a new layer to this precedence table on the left, in a weakest-to-tightest ordering.
This method associates to the right (with this table on the right!), so right-most applications are tighter binding (closer to the atoms) than those to the left. It should not be mixed with
:+, which would be confusing and less predictable.- Aʹ
a weakened version of the type generated by this table, to increase flexibility.
- B
the result type of the new table.
- ops
the operators that make up the new level on the table.
- returns
a new table that incorporates the operators and atoms in this table, along with extra
ops.
- Definition Classes
- Prec
-
final
def
:+[Aʹ >: A, B](ops: Ops[Aʹ, B]): Prec[B]
This method adds a new layer to this precedence table on the right, in a tightest-to-weakest ordering.
This method adds a new layer to this precedence table on the right, in a tightest-to-weakest ordering.
This method associates to the left, so left-most applications are tighter binding (closer to the atoms) than those to the right. It should not be mixed with
+:, which would be confusing and less predictable.- Aʹ
a weakened version of the type generated by this table, to increase flexibility.
- B
the result type of the new table.
- ops
the operators that make up the new level on the table.
- returns
a new table that incorporates the operators and atoms in this table, along with extra
ops.
- Definition Classes
- Prec
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
- val atom0: Parsley[A]
- val atoms: Parsley[A]*
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- 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()
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()