... the context ...
But the context is a discussion of regex quantification, and what is the meaning of deferred or on-demand quantification?
I will make my last-ditch stand upon an appeal to authority: The Book* by Friedl, which uses "lazy" as the primary term for this quantification mode. And there you have it: Friedl said it; I believe it; that settles it!
* At least, the second edition of The Book. For some reason, I couldn't dig out my copy of the first edition, but I'm sure it uses the same terminology. I never bought the third edition. While preferring the term lazy, Friedl also acknowledges the terms "minimal matching", "non-greedy" and "ungreedy". I think I would use maximal/minimal matching in full-blown pedant mode (it is completely unambiguous WRT, e.g., deferred/on-demand/eager evaluation), but too cumbersome for everyday use; greedy/lazy for me. Ungreedy is just more Newspeak and so not to my taste.
Give a man a fish: <%-(-(-(-<
In reply to Re^5: What are greedy and lazy matching in Perl?
by AnomalousMonk
in thread What is greedy and lazy Matching in perl
by shankonit
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |