"Regular Expression Matching Can Be Simple And Fast (but...) "

Trass3r un at known.com
Thu Feb 24 06:56:15 PST 2011


Yep, finite automata FTW!
Same goes for non-regexp string matching, see Aho-Corasick algorithm.


More information about the Digitalmars-d mailing list