In this lesson, we will observe greedy and lazy quantification.
We will start by writing a regular expression highlighting all the tags in our string. To do it, we should enter the opening and closing tag brackets:
>. Here we put a character inside:
There are two tags in the string – opening and closing. Although, we found a match for the whole string. Programmers call this behavior greedy. It means that the quantifier repeats as many times as possible.
In regular expressions, quantification is greedy by default, so we have captured the longest possible substring. The entire string corresponds to our regular expression; everything inside
> counts as tag content.
To avoid greedy behavior, we can specify any character inside the tag instead of any character (except the closing one). In that case, we will process the two tags separately:
Despite the effectiveness of such a solution, it is only an escape from the problem. That way, we can avoid the consequences of greedy behavior but not the behavior itself.
To turn a greedy quantization into a lazy one, you have to use a special symbol
We should remember that many special characters behave differently in regular expressions, depending on the place where they are. If
? were placed after the dot, it would be treated simply as a "no character or one character" quantifier:
<p><a href=" www.yahoo.com ">google</a></p>
? comes right after a quantifier, it's treated by regex as a special character that turns greedy quantifiers into lazy ones.
The Hexlet support team or other students will answer you.
A professional subscription will give you full access to all Hexlet courses, projects and lifetime access to the theory of lessons learned. You can cancel your subscription at any time.
Programming courses for beginners and experienced developers. Start training for free
Our graduates work in companies:
Sign up or sign in
Ask questions if you want to discuss a theory or an exercise. Hexlet Support Team and experienced community members can help find answers and solve a problem.