Subject: Re: [boost] [regex, xpressive] interesting(?) perf benchmark
From: Mathias Gaunard (mathias.gaunard_at_[hidden])
Date: 2010-06-07 09:20:22
Eric Niebler wrote:
> On 6/7/2010 5:50 AM, Mathias Gaunard wrote:
>> Le 07/06/2010 04:58, Eric Niebler wrote:
>>> I'm always suspect of benchmarks, but I figured I'd post this anyway.
>> Just an idea: for static xpressive, couldn't you detect at compile-time
>> that the expression is truly regular, and use a DFA in that case?
> Oh, sure! Why don't you submit a DFA and I'll use it in xpressive? ;-)
How about a warning "you may not be using the optimal tool for the job"
Are the finite state machine libraries in Boost usable for this at all?
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk