Regular grammars and binary matching performance

Hynek Vychodil hynek@REDACTED
Wed Oct 6 13:35:44 CEST 2010

I have just send new regexdna solution using R14's binary module:
It shows how big gain we would have get by limited regular expression
support in binary module. I have written limited regular expression
support in function compile_pattern/1 (very limited and poor man
solution!) as demonstration there
for curiosity.
I think it would be nice to have support for regular grammars in
binary module or adapt as limited
regular expression library because those limited regular expression
(truly regular grammars, without sub-capturing may be and so) could be
feasible in real projects. For comparison, re module is 15 times
slower in this benchmark

Do you think it would be useful? Is anybody working on it already?

Best regards
--Hynek (Pichi) Vychodil

Analyze your data in minutes. Share your insights instantly. Thrill
your boss.  Be a data hero!
Try GoodData now for free:

More information about the erlang-questions mailing list