Regular Expression Quantifiers: Greedy, Lazy, Possessive

This video provides an explanation of how regular expression quantifiers work. It covers greedy, lazy and possessive quantifiers. Various examples and diagrams are provided. The explanations focus on considering a quantifier as a 'range' that specifies the minimum and maximum number of times a part of the regex should be repeated. A detailed explanation of the concept of backtracking is also provided.

The visualizations of the regular expression engine were created using this tool:

SOCIALS
----------------

[Pearlmaster-tnwi]

This is one of the most useful and informative videos I've ever seen. I finally understand it all. Thank you!

[amanimavu]

Awesome, awesome video. Just what I have been looking for to learn about greedy, lazy and possessive quantifiers👍

[herrxerex]

You are gem of person for making this tutorial

[joseluis]

Thank you, this was very enlightening. Good quality content!

[blossomisraelayogu]

Thank you so much. In addition to learning greedy, lazy, and possessive quantifiers, I have also learnt how to sit and code. You sit so upright!! I guess it is for the back, right?

[chachachi-hhks]

When (cat|caterpillar) finds the longest string in text "I like caterpillars", despite that "cat" matches first, it probably also can be counted as greedy mathching

[ilkinq.]

i do not understand regex it is so complicated. but your content's quality is very good.

[jairof]

Which software are you using to show the engine performance?