Regular Expressions Can Be Simple and Fast
March 17, 2010 5:55 AM Subscribe
Russel Cox, one of the people behind Google's new programming language Go, has written a three part series on regular expressions. It's a nice mix of computer science theory, programming, and history: Regular Expression Matching Can Be Simple And Fast, Regular Expression Matching: the Virtual Machine Approach, and Regular Expression Matching in the Wild.
This thread has been archived and is closed to new comments