scala.util.parsing.combinator.PackratParsers
o != arg0
is the same as !(o == (arg0))
.
o != arg0
is the same as !(o == (arg0))
.
the object to compare against this object for dis-equality.
false
if the receiver object is equivalent to the argument; true
otherwise.
Returns a parser that repeatedly parses what this parser parses, interleaved with the sep' parser.
The
sep' parser specifies how the results parsed by this parser should be combined.
Returns a parser that repeatedly parses what this parser parses, interleaved with the sep' parser.
The
sep' parser specifies how the results parsed by this parser should be combined.
chainl1(this, sep)
Returns a parser that repeatedly parses what this parser parses
Returns a parser that repeatedly parses what this parser parses
rep(this)
Returns a parser that repeatedly (at least once) parses what this parser parses.
Returns a parser that repeatedly (at least once) parses what this parser parses.
rep1(this)
A parser combinator for sequential composition which keeps only the left result
A parser combinator for sequential composition which keeps only the left result
p <~ q' succeeds if
p' succeeds and q' succeeds on the input
left over by
p'.
Note: <~ has lower operator precedence than ~ or ~>.
a parser that will be executed after p' (this parser) succeeds -- evaluated at most once, and only when necessary
a Parser' that -- on success -- returns the result of
p'.
o == arg0
is the same as if (o eq null) arg0 eq null else o.equals(arg0)
.
o == arg0
is the same as if (o eq null) arg0 eq null else o.equals(arg0)
.
the object to compare against this object for equality.
true
if the receiver object is equivalent to the argument; false
otherwise.
o == arg0
is the same as o.equals(arg0)
.
o == arg0
is the same as o.equals(arg0)
.
the object to compare against this object for equality.
true
if the receiver object is equivalent to the argument; false
otherwise.
Returns into(fq)
Returns into(fq)
Returns a parser that optionally parses what this parser parses.
Returns a parser that optionally parses what this parser parses.
opt(this)
A parser combinator for partial function application
A parser combinator for partial function application
p ^? f' succeeds if
p' succeeds AND f' is defined at the result of
p';
in that case, it returns f' applied to the result of
p'.
a partial function that will be applied to this parser's result
(see mapPartial' in
ParseResult').
a parser that succeeds if the current parser succeeds and f' is applicable
to the result. If so, the result will be transformed by
f'.
A parser combinator for partial function application
A parser combinator for partial function application
p ^? (f, error)' succeeds if
p' succeeds AND f' is defined at the result of
p';
in that case, it returns f' applied to the result of
p'. If f' is not applicable,
error(the result of
p') should explain why.
a partial function that will be applied to this parser's result
(see mapPartial' in
ParseResult').
a function that takes the same argument as f' and produces an error message
to explain why
f' wasn't applicable
a parser that succeeds if the current parser succeeds and f' is applicable
to the result. If so, the result will be transformed by
f'.
A parser combinator for function application
A parser combinator for function application
p ^^ f' succeeds if
p' succeeds; it returns f' applied to the result of
p'.
a function that will be applied to this parser's result (see map' in
ParseResult').
a parser that has the same behaviour as the current parser, but whose result is
transformed by f'.
A parser combinator that changes a successful result into the specified value.
A parser combinator that changes a successful result into the specified value.
p ^^^ v' succeeds if
p' succeeds; discards its result, and returns v
instead.
The new result for the parser, evaluated at most once (if p
succeeds), not evaluated at all if p
fails.
a parser that has the same behaviour as the current parser, but whose successful result is v
Composes two instances of Function1 in a new Function1, with this function applied first.
Composes two instances of Function1 in a new Function1, with this function applied first.
the result type of function g
a function R => A
a new function f
such that f(x) == g(apply(x))
An unspecified method that defines the behaviour of this parser.
This method is used to cast the receiver object to be of type T0
.
This method is used to cast the receiver object to be of type T0
.
Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression
1.asInstanceOf[String]
will throw a ClassCastException
at runtime, while the expression
List(1).asInstanceOf[List[String]]
will not. In the latter example, because the type argument is erased as
part of compilation it is not possible to check whether the contents of the list are of the requested typed.
the receiver object.
This method creates and returns a copy of the receiver object.
Composes two instances of Function1 in a new Function1, with this function applied last.
Composes two instances of Function1 in a new Function1, with this function applied last.
the type to which function g
can be applied
a function A => T1
a new function f
such that f(x) == apply(g(x))
This method is used to test whether the argument (arg0
) is a reference to the
receiver object (this
).
This method is used to test whether the argument (arg0
) is a reference to the
receiver object (this
).
The eq
method implements an [http://en.wikipedia.org/wiki/Equivalence_relation equivalence relation] on
non-null instances of AnyRef
:
* It is reflexive: for any non-null instance x
of type AnyRef
, x.eq(x)
returns true
.
* It is symmetric: for any non-null instances x
and y
of type AnyRef
, x.eq(y)
returns true
if and
only if y.eq(x)
returns true
.
* It is transitive: for any non-null instances x
, y
, and z
of type AnyRef
if x.eq(y)
returns true
and y.eq(z)
returns true
, then x.eq(z)
returns true
.
Additionally, the eq
method has three other properties.
* It is consistent: for any non-null instances x
and y
of type AnyRef
, multiple invocations of
x.eq(y)
consistently returns true
or consistently returns false
.
* For any non-null instance x
of type AnyRef
, x.eq(null)
and null.eq(x)
returns false
.
* null.eq(null)
returns true
.
When overriding the equals
or hashCode
methods, it is important to ensure that their behavior is
consistent with reference equality. Therefore, if two objects are references to each other (o1 eq o2
), they
should be equal to each other (o1 == o2
) and they should hash to the same value (o1.hashCode == o2.hashCode
).
the object to compare against this object for reference equality.
true
if the argument is a reference to the receiver object; false
otherwise.
This method is used to compare the receiver object (this
) with the argument object (arg0
) for equivalence.
This method is used to compare the receiver object (this
) with the argument object (arg0
) for equivalence.
The default implementations of this method is an [http://en.wikipedia.org/wiki/Equivalence_relation equivalence
relation]:
* It is reflexive: for any instance x
of type Any
, x.equals(x)
should return true
.
* It is symmetric: for any instances x
and y
of type Any
, x.equals(y)
should return true
if and
only if y.equals(x)
returns true
.
* It is transitive: for any instances x
, y
, and z
of type AnyRef
if x.equals(y)
returns true
and
y.equals(z)
returns true
, then x.equals(z)
should return true
.
If you override this method, you should verify that your implementation remains an equivalence relation.
Additionally, when overriding this method it is often necessary to override hashCode
to ensure that objects
that are "equal" (o1.equals(o2)
returns true
) hash to the same Int
(o1.hashCode.equals(o2.hashCode)
).
the object to compare against this object for equality.
true
if the receiver object is equivalent to the argument; false
otherwise.
This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.
This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.
The details of when and if the finalize
method are invoked, as well as the interaction between finalize
and non-local returns and exceptions, are all platform dependent.
Returns a representation that corresponds to the dynamic class of the receiver object.
Returns a representation that corresponds to the dynamic class of the receiver object.
The nature of the representation is platform dependent.
a representation that corresponds to the dynamic class of the receiver object.
Returns a hash code value for the object.
Returns a hash code value for the object.
The default hashing algorithm is platform dependent.
Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)
) yet
not be equal (o1.equals(o2)
returns false
). A degenerate implementation could always return 0
.
However, it is required that if two objects are equal (o1.equals(o2)
returns true
) that they have
identical hash codes (o1.hashCode.equals(o2.hashCode)
). Therefore, when overriding this method, be sure
to verify that the behavior is consistent with the equals
method.
the hash code value for the object.
A parser combinator that parameterizes a subsequent parser with the result of this one
A parser combinator that parameterizes a subsequent parser with the result of this one
Use this combinator when a parser depends on the result of a previous parser. p' should be
a function that takes the result from the first parser and returns the second parser.
p into fq' (with fq' typically
{x => q}') first applies p', and then, if
p' successfully
returned result r', applies
fq(r)' to the rest of the input.
From: G. Hutton. Higher-order functions for parsing. J. Funct. Program., 2(3):323--343, 1992.
a function that, given the result from this parser, returns the second parser to be applied
a parser that succeeds if this parser succeeds (with result x') and if then
fq(x)' succeeds
This method is used to test whether the dynamic type of the receiver object is T0
.
This method is used to test whether the dynamic type of the receiver object is T0
.
Note that the test result of the test is modulo Scala's erasure semantics. Therefore the expression
1.isInstanceOf[String]
will return false
, while the expression List(1).isInstanceOf[List[String]]
will
return true
. In the latter example, because the type argument is erased as part of compilation it is not
possible to check whether the contents of the list are of the requested typed.
true
if the receiver object is an instance of erasure of type T0
; false
otherwise.
o.ne(arg0)
is the same as !(o.eq(arg0))
.
o.ne(arg0)
is the same as !(o.eq(arg0))
.
the object to compare against this object for reference dis-equality.
false
if the argument is not a reference to the receiver object; true
otherwise.
Wakes up a single thread that is waiting on the receiver object's monitor.
Wakes up a single thread that is waiting on the receiver object's monitor.
Wakes up all threads that are waiting on the receiver object's monitor.
Wakes up all threads that are waiting on the receiver object's monitor.
Returns a string representation of the object.
A parser combinator for alternative composition
A parser combinator for alternative composition
p | q' succeeds if
p' succeeds or q' succeeds
Note that
q' is only tried if p's failure is non-fatal (i.e., back-tracking is
allowed).
a parser that will be executed if p' (this parser) fails (and allows back-tracking)
a Parser' that returns the result of the first parser to succeed (out of
p' and q')
The resulting parser succeeds if (and only if)
-
p' succeeds, or
p' fails allowing back-tracking and
q' succeeds.
A parser combinator for alternative with longest match composition
A parser combinator for alternative with longest match composition
p ||| q' succeeds if
p' succeeds or q' succeeds
If
p' and q' both succeed, the parser that consumed the most
characters accepts.
a parser that accepts if p consumes less characters. -- evaluated at most once, and only when necessary
a Parser' that returns the result of the parser consuming the most characters (out of
p' and q').
A parser combinator for sequential composition
A parser combinator for sequential composition
p ~ q' succeeds if
p' succeeds and q' succeeds on the input
left over by
p'.
a parser that will be executed after p' (this parser) succeeds -- evaluated at most once, and only when necessary
a Parser' that -- on success -- returns a
~' (like a Pair, but easier to pattern match on)
that contains the result of p' and that of
q'.
The resulting parser fails if either p' or
q' fails.
A parser combinator for non-back-tracking sequential composition
A parser combinator for non-back-tracking sequential composition
p ~! q' succeeds if
p' succeeds and q' succeeds on the input
left over by
p'. In case of failure, no back-tracking is performed
(in an earlier parser produced by the | combinator).
a Parser' that -- on success -- returns a
~' (like a Pair, but easier to pattern match on)
that contains the result of p' and that of
q'.
The resulting parser fails if either p' or
q' fails, this failure is fatal.
A parser combinator for sequential composition which keeps only the right result
A parser combinator for sequential composition which keeps only the right result
p ~> q' succeeds if
p' succeeds and q' succeeds on the input
left over by
p'.
a parser that will be executed after p' (this parser) succeeds -- evaluated at most once, and only when necessary
a Parser' that -- on success -- returns the result of
q'.
The root class of packrat parsers.