Greedy match(greedy quantifier)

A quantifier that takes as many characters as it can before checking the rest of the pattern. It gives the longest fit, and it backtracks when the rest of the rule then fails.

• See also: Quantifier
• See also: Backtracking
• Used in: Text Patterns

Back to the glossary