Mastering Regular Expressions, 3rd EditionUnderstand Your Data and Be More Productive
By Jeffrey E.F. Friedl
Publisher: O'Reilly Media
Final Release Date: August 2006
that every programmer must read.
Even, if you already manage regexp, and took a compiler course at college, still there are several tips that may help you a lot in this area, including bounding cases: Greediness and Laziness Always Favor a Match, Speed and Efficiency, Summary: NFA and DFA in Comparison, Among others good titles (details of lookahead, lookbehinds, Posix regexps, etc.).
Also, provides some common examples that each coder must face in several projects: recognition of IP address, emails, etc., although this is not a cookbook, always is useful to see coding examples after theory However this is likelihood not as important as was 10 years ago (because there is a lot of examples in the net and cookbooks). A look to how to add benchmarking in different platforms -languages- and optimization for regexps. As usual, you can go directly to any chapter related to your favorite implementation/language.
Perhaps, after eight years, it could consider some current RE frameworks, including those that use NFA, such us, ICU Regular Expressions, Automaton, etc. (this way the spectrum of examples is better). Although this paradigm of never-ending engines are commented in the book, always is good to have an update (well, at least after five years).