public class MarkLookBehindEntriesVisitor extends NFATraversalRegexASTVisitor
This entire mechanism assumes that all lookbehind assertion have a fixed length!
RegexAST.createPrefix()ast| Constructor and Description |
|---|
MarkLookBehindEntriesVisitor(RegexAST ast) |
| Modifier and Type | Method and Description |
|---|---|
protected boolean |
canPruneAfterUnconditionalFinalState() |
protected void |
enterLookAhead(LookAheadAssertion assertion) |
protected boolean |
isBuildingDFA() |
protected void |
leaveLookAhead(LookAheadAssertion assertion) |
void |
run() |
protected void |
visit(RegexASTNode target)
Visit the next successor found.
|
calcQuantifierGuards, canTraverseCaret, caretsOnPath, dollarsOnPath, getCurrentMatchedConditionGroups, getGroupBoundaries, getLastDollarOnPath, getMatchedConditionGroups, getQuantifierGuardsOnPath, getTraversableLookBehindAssertions, hasQuantifierGuards, isReverse, run, setCanTraverseCaret, setMatchedConditionGroups, setReverse, setTraversableLookBehindAssertionspublic MarkLookBehindEntriesVisitor(RegexAST ast)
public void run()
protected void visit(RegexASTNode target)
NFATraversalRegexASTVisitorvisit in class NFATraversalRegexASTVisitorprotected void enterLookAhead(LookAheadAssertion assertion)
enterLookAhead in class NFATraversalRegexASTVisitorprotected void leaveLookAhead(LookAheadAssertion assertion)
leaveLookAhead in class NFATraversalRegexASTVisitorprotected boolean isBuildingDFA()
isBuildingDFA in class NFATraversalRegexASTVisitorprotected boolean canPruneAfterUnconditionalFinalState()
canPruneAfterUnconditionalFinalState in class NFATraversalRegexASTVisitor