Subject: Re: [boost] [regex, xpressive] interesting(?) perf benchmark
From: Mathias Gaunard (mathias.gaunard_at_[hidden])
Date: 2010-06-08 09:31:25
John Bytheway wrote:
> The library will take this lexer specification and turn it into an NFA,
> then transform that into a DFA, then encode that as a transition table
> in an array, *all at compile time*. On reflection, it probably would
> have been better (and faster) to use the giant-switch-statement
> approach, rather than an array-based transition table.
Boost.Switch (from Steven Watanabe if I remember well) probably has
limitations of its own.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk