Regex implementation that can handle machine-generated regex's: *non-backtracking*, O(n)?

Question

Edit 2: For a practical demonstration of why this remains important, look no further than stackoverflow\'s own regex-caused outage today (2016-07-2

Answer 1

Where can I find robustly fast Regex implementation?

You can't.

Someone has to say it, the answer to this question given the restrictions is surely you can't - its unlikely you will find an implementation matching your constraints.

Btw, I am sure you have already tried so, but have you compiled the regex (with the option that outputs to an assembly) - I say because:

if you have a complex Regex and millions of short strings to test