Class Make :: PolynomialBackTrackingTerm
A term that may cause a regular expression engine to perform a polynomial number of match attempts, relative to the input length.
Import path
import codeql.regex.nfa.SuperlinearBackTracking
Predicates
getPrefixMessage |
Gets a message for which prefix a matching string must start with for this term to cause polynomial backtracking. |
getPreviousLoop |
Gets a predecessor to |
getPumpString |
Gets the string that should be repeated to cause this regular expression to perform polynomially. |
getReason |
Gets the reason for the number of match attempts. |
getRootTerm |
Gets the outermost term of this regular expression. |
hasLocationInfo |
Holds if this term has the specific location. |
isAtEndLine |
Holds if all non-empty successors to the polynomial backtracking term matches the end of the line. |
toString |
Gets a string representation of this term. |