Skip to content


💼 This rule is enabled in the following configs: 🟢 flat/recommended, 🔵 recommended.

🔧 This rule is automatically fixable by the --fix CLI option.

disallow unnecessarily non-greedy quantifiers

📖 Rule Details

This rule reports lazy quantifiers that don't need to by lazy.

There are two reasons why a lazy quantifier doesn't have to lazy:

  1. It's a constant quantifier (e.g. a{3}?).

  2. The quantifier is effectively possessive (e.g. a+?b).

    Whether a quantifier (let's call it q) is effectively possessive depends on the expression after it (let's call it e). q is effectively possessive if q cannot accept the character accepted by e and e cannot accept the characters accepted by q.

    In the example above, the character a and the character b do not overlap. Therefore the quantifier a+ is possessive.

    Since an effectively possessive quantifier cannot give up characters to the expression after it, it doesn't matter whether the quantifier greedy or lazy. However, greedy quantifiers should be preferred because they require fewer characters to write and are easier to visually parse.

Now loading...

🔧 Options


🚀 Version

This rule was introduced in eslint-plugin-regexp v0.10.0

🔍 Implementation