fancy-regex VS samurai

https://github.com/fancy-regex/fancy-regex/issues/84 it's still open issue

Ahh, very interesting, thanks for sharing! Do you have any thoughts around why that is? I presume that's due to Oniguruma supporting a much broader feature set and something like fancy-regexp's approach with mixing a backtracking VM and NFA implementation for simple queries would be needed for better perf? (I am aware you played a role in that) [1]

I have been playing around with regex parsing through building parsers through parser combinators at runtime recently, no clue how it will perform in practice yet (structuring parser generators at runtime is challenging in general in low-level languages) but maybe that could pan out and lead to an interesting way to support broader sets of regex syntaxes like POSIX in a relatively straightforward and performant way.

[1] https://github.com/fancy-regex/fancy-regex#theory

Not an expert but fancy regex is a Rust library that uses a hybrid approach to detect whether a sub expression contains backtracking and delegates to the appropriate engine.

https://github.com/fancy-regex/fancy-regex

Samurai is a faster, drop-in replacement for ninja.

https://github.com/michaelforney/samurai

"If you want to do what "scrappy Google" did these days, then you should use Python + Ninja."

Or, better yet, use a simpler, faster and more portable^1 Ninja written in C.

https://github.com/michaelforney/samurai

1. The "simpler, faster, and more portable", are the author's claims, not mine. I am not the author.

Why is Python not portable, as in, on which systems is "build Python and then use that to run Meson" not a reasonable option?

The CI for boson seems like it runs on platforms where Python definitely is available, but also I notice the CI uses samurai, a reimplementation of ninja with a similar motivation: https://github.com/michaelforney/samurai

Ninja is in C++ so I am even more confused at Sanurai.

Is this just an implementation-diversity thing? (which is great!)

This means ninja is popular both on embedded for its tiny footprint (samurai is about 3k sloc and portable), and for humongous projects like Chrome, because it is infinitely scalable in complexity due to its genaration method.

You could probably post-process samurai (a rewrite of ninja into C) into a single-file: https://github.com/michaelforney/samurai