Forgive me if I'm patronizing, but is there any surprise that a POSIX
NFA implementation is slower than grep's DFA?
Oh, of course an NFA implementation will always be slightly slower but
the memory footprint will also be smaller, which is a big advantage for
embedded systems. But in this case,
On 25 Jun 2011 15:08, "Gabor Kovesdan" wrote:
>
> Hi Folks,
>
> you may know that in the Summer of Code programme I'm working on replacing
the old regex code with TRE, which is a BSD-licensed implementation. It
supports wide characters, is POSIX-compliant and has a good performance
compared to mos
Hi Folks,
you may know that in the Summer of Code programme I'm working on
replacing the old regex code with TRE, which is a BSD-licensed
implementation. It supports wide characters, is POSIX-compliant and has
a good performance compared to most of the open source implementations.
Actually, I
