MegaIng

After looking into greenery a bit, I figured out that the performance is acceptable, if used correctly. The main drawback in performance is not actually the calculation of the intersection,...

I thing I manged to add support for lookaheads (not lookbacks). You can see an example on my fork of greenery: https://github.com/MegaIng/greenery. I thing lookbacks are possible, but way harder....

Welp, I forgot the edge case if the lookahead is at the end of the string. This will take a moment to implemented (but will make a huge step in...

Ok, I added support for lookaheads at the end of regexps. (And prepared a bit for lookbacks). Now I am pretty sure that lookaheads work (except lookaheads of infinite length....

I am now using that grammar and it is showing me a few missing features (e.g flags). I would really like to have a grammar that tests all possible edge...

Ok, I added basic flag support (`s` and `i`). lookbacks are still not done. Also, Unicode support is missing completly. I thing the system can now be used and we...

You can see my current progress at https://github.com/MegaIng/greenery (entry point is [grammar_checker.py](https://github.com/MegaIng/greenery/blob/master/grammar_checker.py)). I already did many of the obvious optimizations (including pre-computing all regexes). For 13 regexes (The number of...

I managed to save around 1 sec by changing a bit of behavior in the FSM inner workings. This is now down to around 0.7-0.8 seconds which feels way more...

OK, I got it down to 0.6 secs, which is not that much above your goal. There might be many small improvements that can be done, bringing it around 0.5...

Some are likely, some are not likely. We could just mention @qntm and see if he has anything to say in regards to this. Some of the files I currently...