[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Regular expressions with high or nested repetition counters
From: |
Paul Eggert |
Subject: |
Re: Regular expressions with high or nested repetition counters |
Date: |
Wed, 05 May 2010 13:23:45 -0700 |
User-agent: |
Gnus/5.13 (Gnus v5.13) Emacs/23.1 (gnu/linux) |
Dag Hovland <address@hidden> writes:
> http://hdl.handle.net/1956/3628
> http://www.ii.uib.no/~dagh/fac/
> I wondered if you are interested in having this kind of functionality in
> GNU grep?
Yes, we're always interested in performance improvements, and this one
looks like it'd be a substantial one.
> Note that for the majority of normal/simple regexps, grep
> does better than my program above. Also, it only handles a
> (well-defined) subclass of regexps. So we would need to find a nice
> way to choose which algorithm to use when.
Yes, all that would need to be done, and we'd neet to find a volunteer
to help out, as you say that you're not that good in C. (I'm probably
not the guy, as I don't have enough free time.) Also, for legal reasons
you and your employer would need to sign papers granting copyright to
the Free Software Foundation; is that doable?