> > regex parsing implementation when optimized sufficiently is very close in implementation to C code > I used to think that, but it is really not true unless

> > regex parsing implementation when optimized sufficiently is very close in implementation to C code > I used to think that, but it is really not true unless your regex engine contains a JIT compiler. The P6 Rules engine is written in NQP so it gets JIT'd on the JVM and MoarVM backends. Of course it'll be many years before the engine is seriously optimized but it's a good start. It'll be interesting to see if the code gen of this next gen regexen engine gets good enough in 2015 to make its advantages (most notably the grapheme-by-default design) actually pay dividends.