Uses of Interface
org.parboiled.trees.GraphNode

Packages that use GraphNode

Package	Description
org.parboiled
org.parboiled.matchers
org.parboiled.trees

Uses of GraphNode in org.parboiled

Subinterfaces of GraphNode in org.parboiled

Modifier and Type	Interface and Description
interface	Node<V> Represents a node in the parse tree created during a parsing run.

Uses of GraphNode in org.parboiled.matchers

Subinterfaces of GraphNode in org.parboiled.matchers

Modifier and Type	Interface and Description
interface	Matcher A Matcher instance is responsible for "executing" a specific Rule instance, i.e.

Classes in org.parboiled.matchers that implement GraphNode

Modifier and Type	Class and Description
class	AbstractMatcher Abstract base class of most regular Matchers.
class	ActionMatcher A Matcher that not actually matches input but runs a given parser Action.
class	AnyMatcher A Matcher matching any single character except EOI.
class	AnyOfMatcher A Matcher matching a single character out of a given Characters set.
class	CharIgnoreCaseMatcher A Matcher matching a single character case-independently.
class	CharMatcher A Matcher matching a single given character.
class	CharRangeMatcher A Matcher matching a single character out of a given range of characters.
class	CustomMatcher Base class of custom matcher implementations.
class	EmptyMatcher A Matcher that always successfully matches nothing.
class	FirstOfMatcher A Matcher trying all of its submatchers in sequence and succeeding when the first submatcher succeeds.
class	FirstOfStringsMatcher A specialized FirstOfMatcher that handles FirstOf(string, string, ...) rules much faster that the regular FirstOfMatcher.
class	MemoMismatchesMatcher Special wrapping matcher that performs memoization of the last mismatch of the wrapped sub rule.
class	NothingMatcher A Matcher that never matches anything.
class	OneOrMoreMatcher A Matcher that repeatedly tries its submatcher against the input.
class	OptionalMatcher A Matcher that tries its submatcher once against the input and always succeeds.
class	ProxyMatcher A Matcher that delegates all Rule and Matcher interface methods to another Matcher.
class	SequenceMatcher A Matcher that executes all of its submatchers in sequence and only succeeds if all submatchers succeed.
class	StringMatcher A SequenceMatcher specialization for sequences of CharMatchers.
class	TestMatcher A special Matcher not actually matching any input but rather trying its submatcher against the current input position.
class	TestNotMatcher A special Matcher not actually matching any input but rather trying its submatcher against the current input position.
class	VarFramingMatcher Special wrapping matcher that manages the creation and destruction of execution frames for a number of action vars.
class	ZeroOrMoreMatcher A Matcher that repeatedly tries its submatcher against the input.

Uses of GraphNode in org.parboiled.trees

Classes in org.parboiled.trees with type parameters of type GraphNode

Modifier and Type	Interface and Description
interface	GraphNode<T extends GraphNode<T>> A node in a directed graph (that may have cycles).
class	ImmutableGraphNode<T extends GraphNode<T>> A simple, immutable GraphNode implementation.

Subinterfaces of GraphNode in org.parboiled.trees

Modifier and Type	Interface and Description
interface	BinaryTreeNode<T extends BinaryTreeNode<T>> A TreeNode specialization with only two child nodes, left and right.
interface	MutableBinaryTreeNode<T extends MutableBinaryTreeNode<T>> A MutableTreeNode specialization also satisfying the BinaryTreeNode interface and providing mutability methods.
interface	MutableTreeNode<T extends MutableTreeNode<T>> A TreeNode specialiation that allow for mutability of the tree structure.
interface	TreeNode<T extends TreeNode<T>> A specialization of a GraphNode that contains a reference to its parent, thereby making the graph a tree (since each node can now have only one parent node).

Classes in org.parboiled.trees that implement GraphNode

Modifier and Type	Class and Description
class	ImmutableBinaryTreeNode<T extends BinaryTreeNode<T>> A simple immutable implementation of the BinaryTreeNode interface.
class	ImmutableGraphNode<T extends GraphNode<T>> A simple, immutable GraphNode implementation.
class	ImmutableTreeNode<T extends TreeNode<T>> An ImmutableGraphNode specialization representing a tree node with a parent field linking back to the nodes (only) parent.
class	MutableBinaryTreeNodeImpl<T extends MutableBinaryTreeNode<T>> A simple MutableBinaryTreeNode implementation based on the MutableTreeNodeImpl.
class	MutableTreeNodeImpl<T extends MutableTreeNode<T>> A base implementation of the MutableTreeNode.

Methods in org.parboiled.trees with type parameters of type GraphNode

Modifier and Type	Method and Description
static <T extends GraphNode<T>,C extends Collection<T>> C	GraphUtils.collectAllNodes(T node, C collection) Collects all nodes from the graph reachable from the given node in the given collection.
static <T extends GraphNode<T>> int	GraphUtils.countAllDistinct(T node) Counts all distinct nodes in the graph reachable from the given node.
static <T extends GraphNode<T>> T	GraphUtils.getFirstChild(T node) Returns the first child node of the given node or null if node is null or does not have any children.
static <T extends GraphNode<T>> T	GraphUtils.getLastChild(T node) Returns the last child node of the given node or null if node is null or does not have any children.
static <T extends GraphNode<T>> String	GraphUtils.printTree(T node, Formatter<T> formatter) Creates a string representation of the graph reachable from the given node using the given formatter.
static <T extends GraphNode<T>> String	GraphUtils.printTree(T node, Formatter<T> formatter, Predicate<T> nodeFilter, Predicate<T> subTreeFilter) Creates a string representation of the graph reachable from the given node using the given formatter.

Methods in org.parboiled.trees with parameters of type GraphNode

Modifier and Type	Method and Description
static boolean	GraphUtils.hasChildren(GraphNode<?> node) Returns true if this node is not null and has at least one child node.