7 Jun
2010
7 Jun
'10
1:20 p.m.
Eric Niebler wrote:
On 6/7/2010 5:50 AM, Mathias Gaunard wrote:
I'm always suspect of benchmarks, but I figured I'd post this anyway. <snip> Just an idea: for static xpressive, couldn't you detect at compile-time
Le 07/06/2010 04:58, Eric Niebler wrote: 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" until then? Are the finite state machine libraries in Boost usable for this at all?