gologo13のブックマーク - はてなブックマーク

Implementing Regular Expressions
Implementing Regular Expressions Russ Cox rsc@swtch.com This page collects resources about implementing regular expression search efficiently. Articles and Notes “Regular Expression Matching Can Be Simple And Fast” An introduction to using finite automata to implement regular expression matching, and why the standard backtracking implementation is a bad idea. Supporting programs: NFA | DFA | bound
gologo13 2010/08/17
regexp
リンク
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
gologo13 2010/08/17
regexp
リンク
1

はてなブックマーク