Holds if there are transitions from the components of q
to the corresponding
components of r
labelled with s1
, s2
, and s3
, respectively.
Where the edges s1
, s2
, and s3
all share at least one character.
Import path
import codeql.regex.nfa.SuperlinearBackTracking
predicate
step
(
StateTuple
q
,
InputSymbol
s1
,
InputSymbol
s2
,
InputSymbol
s3
,
StateTuple
r
)