| Sign In/My Account | View Cart |
 |
We've expanded our Perl news coverage and improved our search! Search for all things Perl across O'Reilly! Regular Expressions Backtracking in regular expressions For a regular expression to match, the entire regular expression must match, not just part of it. So if the beginning of a pattern containing a quantifier succeeds in a way that causes later parts in the pattern to fail, the matching engine backs up and recalculates the beginning part--that's why it's called backtracking. How Regexes Work How do Perl's regexes work on the inside? Suppose you were going to write a language like Perl, which has regexes, in a language like C, which doesn't? How might you do that? MakeRegex The Perl-module MakeRegex composes a regex-expression from a list of words. It had been inspired by the emacs elisp module make-regex.el, by Simon Marshall. Mastering Regular Expressions: Powerful Techniques for Perl and Other Tools Regular expressions, a powerful tool for manipulating text and data, are found in scripting languages, editors, programming environments, and specialized tools. In this book, author Jeffrey Friedl leads you through the steps of crafting a regular expression that gets the job done. He examines a variety of tools and uses them in an extensive array of examples, dedicating an entire chapter to Perl. ISBN: 1-56592-257-3, by Jeffr ey E. F. Friedl. Perl Regular Expression Matching is NP-Complete Some regular expression matches can take a very long time. Can this be avoided? Probably not. Here's why. PERL5 Regular Expression Description By Tom Christiansen Regular Expressions The entire chapter from Joseph N. Hall's book, Effective Perl Programmming, in Adobe Acrobat format. Regular Expressions Pattern matching and regular expressions
|
|
Sponsored By:
|
|
||||||||
|
||||||||
