|
Boost Users : |
From: Eric Niebler (eric_at_[hidden])
Date: 2006-04-13 13:03:10
Stuart Dootson wrote:
> On 4/13/06, Lynn Allan <l_d_allan_at_[hidden]> wrote:
>> FWIW, here are some timings for different "flavors" of xpressive, and
>> some other boost and non-boost search algo's. YMMW.
>>
>
> Lynn - it might be interesting to use re2c (http://re2c.org/) to
> generate regex machines and see what their performance is like - after
> all, they do clain 're2c generates warning free code that is equal to
> hand-written code in terms of size, speed and quality.' (I'm offering
> no opinion on the veracity of that statement....), so (allegedly)
> they'd give a reasonable hand-code analogue....
I don't think re2c does backreferences, so it might not be usable for
Lynn's purposes. It also means any comparison would be apples to
oranges, since regex matching with backreferences is a much harder problem.
-- Eric Niebler Boost Consulting www.boost-consulting.com
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net