Re:Regular Expression Matching Can Be Simple And Fast
by newt0311 on Thursday February 05, 2009 @12:59AM
(#467173)
Nope. Backref and friends can be implemented on top of DFAs. Grep offers an example of such an implementation.
[ Parent
| on HN ]
There are no comments on this comment yet.