I\'m looking for a performance comparison between perl and boost regular expression.
I need to design a piece of code which relies very heavily on regular expressions, and c
The perl interpreter is going to be a fixed cost. If the time saved by running your data through the interpreter greatly outweighs the interpreter costs(ie, you have a lot of data), you will have a performance boost.
It's probable that you're best of with pure C++ here, just because of the process invocation.
Sorry, I don't have data. Love to see your test results though.