Thoughts and links about programming, by

Regular Expression Article #3
Posted on Thursday, March 11, 2010.

In January 2007 I posted an article on my web site titled “Regular Expression Matching Can Be Simple And Fast.” I intended this to be the first of three; the second would explain how to do submatching using automata, and the third would explain how to make a really fast DFA. I posted the second article a few months ago.

Today, the third and final article is available, along with an open source production implementation called RE2.

(Comments originally posted via Blogger.)

  • tef (March 11, 2010 12:04 PM) Hi, the following images are a 404:

    linked in the sentence: " for example, look at \p{Greek} (the Greek script) or at \p{Lu} "

  • Russ Cox (March 11, 2010 12:33 PM) @tef: Fixed, thank you.

  • niemeyer (July 7, 2010 3:55 PM) It looks very nice, thanks for publishing this.

    Do you plan to evolve Go's regexp package in this direction as well?