3 ms·
Previously: "Regular Expression Matching Can Be Simple And Fast" (2007) https://swtch.com/~rsc/regexp/regexp1.html https://swtch.com/~rsc/regexp/regexp1.html Th
by dexen 10y ago
Previously: "Regular Expression Matching Can Be Simple And Fast" (2007) https://swtch.com/~rsc/regexp/regexp1.html https://swtch.com/~rsc/regexp/regexp1.html
The paper deals with "Thompson NFA" approach to regex, with low computational complexity.
Other Russ' papers on regular expression matching: https://swtch.com/~rsc/regexp/ https://swtch.com/~rsc/regexp/
- Terr_ 10y agoIt's funny, I had an immediate "I've seen these graphs before" reaction" with this article, and it turns out your first link is something I was working on last month for a leetcode question. It was probably one of the more useful/understandable pages I found in that process.