public class MatchFound extends Term
MatchFound nodes are RegexASTNodes that represent the initial/final states of the
non-deterministic finite state automaton generated from the regular expression.
Regular expressions are translated into non-deterministic finite state automata, with each
RegexASTNode in the RegexAST contributing some of the states or transitions. The
MatchFound nodes are those that contribute the final (accepting) states. The root group
of every regular expression is linked (using the 'next' pointer) to a single MatchFound
node. Other MatchFound nodes appear in look-behind and look-ahead assertions, where they
contribute the final states of their subautomata (look-around assertions generate subautomata
which are then joined with the root automaton using a product construction).
MatchFound nodes are also used as initial states (the initial states of the forward
search automaton are the final states of the reverse search automaton). Therefore, there is a set
of MatchFound nodes used as final states in forward search (reachable by 'next' pointers)
and as initial states in reverse search and a set of MatchFound nodes used as final
states in reverse search (reachable by 'prev' pointers) and as initial states in forward search.
MatchFound being used as NFA initial states is also why they can have a next-pointer (
MatchFound.getNext()) themselves (see RegexAST.getNFAUnAnchoredInitialState(int)).
| Constructor and Description |
|---|
MatchFound() |
| Modifier and Type | Method and Description |
|---|---|
MatchFound |
copy(RegexAST ast)
Copy this node only, without any child nodes.
|
MatchFound |
copyRecursive(RegexAST ast,
CompilationBuffer compilationBuffer)
Recursively copy this subtree.
|
boolean |
equalsSemantic(RegexASTNode obj) |
RegexASTNode |
getNext() |
void |
setNext(RegexASTNode next) |
JsonValue |
toJson() |
String |
toString() |
getSeqIndex, getSubTreeParent, setSeqIndexasAtomicGroup, asBackReference, asCharacterClass, asGroup, asLookAheadAssertion, asLookAroundAssertion, asLookBehindAssertion, asMatchFound, asPositionAssertion, asQuantifiableTerm, asSequence, asSubtreeRootNode, astNodeId, endsWithDollar, getFlags, getId, getMaxPath, getMinPath, getParent, hasBackReferences, hasCaptureGroups, hasCaret, hasDollar, hasEmptyGuard, hasLookAheads, hasLookBehinds, hasLoops, hasQuantifiers, idInitialized, incMaxPath, incMaxPath, incMinPath, incMinPath, isAtomicGroup, isBackReference, isCaret, isCharacterClass, isDead, isDollar, isExpandedQuantifier, isFlagSet, isGroup, isInLookAheadAssertion, isInLookBehindAssertion, isLookAheadAssertion, isLookAroundAssertion, isLookBehindAssertion, isMatchFound, isPositionAssertion, isPrefix, isQuantifiableTerm, isRoot, isSequence, isSubtreeRoot, markAsDead, setDead, setEmptyGuard, setEndsWithDollar, setEndsWithDollar, setExpandedQuantifier, setFlag, setFlag, setFlags, setHasBackReferences, setHasCaptureGroups, setHasCaret, setHasCaret, setHasDollar, setHasDollar, setHasLookAheads, setHasLookBehinds, setHasLoops, setHasLoops, setHasQuantifiers, setId, setMaxPath, setMinPath, setParent, setPrefix, setStartsWithCaret, setStartsWithCaret, startsWithCaret, toJson, toStringWithIDclone, equals, getClass, hashCode, notify, notifyAll, wait, wait, waitgetIdpublic MatchFound copy(RegexAST ast)
RegexASTNodepublic MatchFound copyRecursive(RegexAST ast, CompilationBuffer compilationBuffer)
RegexASTNodeCopyVisitor if
the copying process is required to be thread-safe. The ID and minPath of the copied nodes is
left unset.copyRecursive in class Termast - RegexAST the new nodes should belong to.public RegexASTNode getNext()
public void setNext(RegexASTNode next)
public boolean equalsSemantic(RegexASTNode obj)
equalsSemantic in class RegexASTNodepublic JsonValue toJson()