You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
There is a whole class of fixable problems optimal-quantifier-concatenation (OQC) can't detect yet. Right now, OQC can only detect (and fix) the concatenation of single-character quantifier (e.g. \d*\w*). It's can't detect anything else.
OQC should also be able to detect (and fix) (?:foo)?\w+ == \w+.
More generally, if we have a single-character quantifier A{n,∞} and a quantifier B{p,q}, we will be able to simplify B{p,q} to B{p} if all possible consumed characters of B are a subset of A (getConsumedCharacters(B) ⊆ getConsumedCharacters(A)).
The text was updated successfully, but these errors were encountered:
There is a whole class of fixable problems
optimal-quantifier-concatenation
(OQC) can't detect yet. Right now, OQC can only detect (and fix) the concatenation of single-character quantifier (e.g.\d*\w*
). It's can't detect anything else.OQC should also be able to detect (and fix)
(?:foo)?\w+
==\w+
.More generally, if we have a single-character quantifier
A{n,∞}
and a quantifierB{p,q}
, we will be able to simplifyB{p,q}
toB{p}
if all possible consumed characters ofB
are a subset ofA
(getConsumedCharacters(B) ⊆ getConsumedCharacters(A)
).The text was updated successfully, but these errors were encountered: