Regular Expression Matching in the Wild

Regular Expression Matching in the Wild Russ Cox rsc@swtch.com March 2010 Introduction The first two articles in this series, “Regular Expression Matching Can Be Simple And Fast” and “Regular Expression Matching: the Virtual Machine Approach,” introduced the foundation of DFA-based and NFA-based regular expression matching. Both were based on toy implementations optimized for teaching the basic id

[ganaware]

Google RE2 http://code.google.com/p/re2/