|
|||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||
Matchers.ParseError wrapping an ActionException.Matcher that not actually matches input but runs a given parser Action.false.
true.
true if each of its
components evaluates to true.
true if each of its
components evaluates to true.
true if both of its
components evaluate to true.
Matcher matching any single character except EOI.Matcher matching a single character out of a given Characters set.ParseError implementation for a one-char parse error with an optional error message.ParseRunner implementations.TreeNode specialization with only two child nodes, left and right.MatcherVisitor determining whether a matcher can legally succeed with an empty match.Matcher matching a single character case-independently.Matcher matching a single given character.Matcher matching a single character out of a given range of characters.index specifies a valid element in an array,
list or string of size size.
index specifies a valid element in an array,
list or string of size size.
index specifies a valid position in an array,
list or string of size size.
index specifies a valid position in an array,
list or string of size size.
start and end specify a valid positions
in an array, list or string of size size, and are in order.
String.
IndentDedentInputBuffer.
Formatter for InvalidInputErrors that automatically creates the correct "expected" text
for the error.MatcherVisitor implementation that delegates all visiting methods to one default value method.DoWithMatcherVisitor.Action against a whole matcher hierarchy in a depth-first manner.Matcher that always successfully matches nothing.byte[] representation i accordance with RFC 2045.
char[] representation i accordance with RFC 2045.
String representation in accordance with RFC 2045.
true if they are equal ignoring
the case.
true if the object being
tested equals() the given target or both are null.
ParseRunner implementation that creates a simple BasicParseError for the first error found in the
input and adds it to the list of ParseErrors.ParseRunner implementation that creates an
InvalidInputError for the error at a known error location.Characters
with their respective escape sequences.
Characters
with their respective escape sequences.
Var.enterFrame().
String from all character between the given indices.
String from all character covered by the given IndexRange.
String containing all characters with the given line number except for the trailing
newline.
Matcher trying all of its submatchers in sequence and succeeding when the first submatcher succeeds.TracingParseRunner.
IndexRange instance covering the input text matched by the rule immediately preceding the
action expression that is currently being evaluated.
MatcherPath to the currently running matcher.
Position
object.
InputBuffer as a
Position instance.
GraphNodes).BinaryTreeNode interface.GraphNode implementation.ImmutableGraphNode specialization representing a tree node with a parent field linking back to the nodes
(only) parent.true if the object reference
being tested is a member of the given collection.
IndentDedentInputBuffer.
true if the object being
tested is an instance of the given class.
ParseError describing one or more input characters that are illegal with regard to the underlying
language grammar.true if the object reference
being tested is null.
MatcherVisitor determining whether a matcher is a basic single character matcher.MatcherVisitor determining whether a matcher can start a match with a given char.Iterable into
a single String containing the provided elements.
Iterator into
a single String containing the provided elements.
len characters of a String.
0 if the String is null.
TracingParseRunner.
Matcher stack at a certain point during the parsing process.Matchers.MatcherContext.len characters from the middle of a String.
MutableTreeNode specialization also satisfying the BinaryTreeNode interface
and providing mutability methods.MutableBinaryTreeNode implementation based on the MutableTreeNodeImpl.TreeNode specialiation that allow for mutability of the tree structure.MutableTreeNode.true if the given predicate
evaluates to false.
Matcher that never matches anything.true if the object reference
being tested is not null.
Matcher that repeatedly tries its submatcher against the input.TracingParseRunner.
TracingParseRunner.
TracingParseRunner.
Matcher that tries its submatcher once against the input and always succeeds.true if any one of its
components evaluates to true.
true if any one of its
components evaluates to true.
true if either of its
components evaluates to true.
ParsingResult object.
ParsingResult object.
ParseRunner implementation that "watches" a parser digest a number
of inputs and collects all sorts of statistical data on the what rules have matched how many times, the number
of reincovations of rules at identical input locations, and so on.Matcher that delegates all Rule and Matcher interface methods to another Matcher.ParseRunner implementation that is able to recover from InvalidInputErrors in the input and therefore
report more than just the first InvalidInputError if the input does not conform to the rule grammar.ParseRunner implementation that properly reports the first InvalidInputError if the input
does not conform to the rule grammar.ValueStack.takeSnapshot().
len characters of a String.
TracingParseRunner.
TracingParseRunner.
Matcher that executes all of its submatchers in sequence and only succeeds if all submatchers succeed.Var for StringBuilders.SequenceMatcher specialization for sequences of CharMatchers.Var for Strings.Matcher not actually matching any input but rather trying its submatcher against the current input
position.Matcher not actually matching any input but rather trying its submatcher against the current input
position.ParseRunner implementation used for debugging purposes.GraphNode that contains a reference to its parent, thereby making the graph a tree
(since each node can now have only one parent node).TracingParseRunner.
Matcher that repeatedly tries its submatcher against the input.
|
|||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||