Re: [boost] [regex, xpressive] interesting(?) perf benchmark

Subject: Re: [boost] [regex, xpressive] interesting(?) perf benchmark
From: Steven Watanabe (watanabesj_at_[hidden])
Date: 2010-06-08 10:03:44

AMDG

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.
>   

In my experience, array lookups tend to be faster than
switch statements.

In Christ,
Steven Watanabe