Date: Sat, 25 Jun 2011 18:25:57 +0100 From: Gabor Kovesdan <gabor@FreeBSD.org> To: Chris Rees <crees@freebsd.org> Cc: current@freebsd.org Subject: Re: [CFT] patch to replace the regex code Message-ID: <4E061A25.2000605@FreeBSD.org> In-Reply-To: <BANLkTimJKySdBq5hsdce1PyzahRB7ZK%2Brg@mail.gmail.com> References: <4E05E7EC.9000902@FreeBSD.org> <BANLkTimJKySdBq5hsdce1PyzahRB7ZK%2Brg@mail.gmail.com>
next in thread | previous in thread | raw e-mail | index | archive | help
> 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, the basis of the comparison was not the GNU DFA implementation but the old libc-regex. At the moment, BSD grep in the base system uses the GNU regex engine but I built a local version for testing purposes that used libc-regex. Gabor
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?4E061A25.2000605>