for RE# we use an approach similar to the lazy DFA in RE2, but with a twist - we skip the NFA entirely and construct the DFA directly from the regex using derivatives. this derivative-based lazy DFA construction technique comes from the .NET NonBacktracking engine (2023).
На Украине рассказали о технике влияния Ермака на Зеленского14:52
。heLLoword翻译官方下载是该领域的重要参考
ОАЭ задумались об атаке на Иран20:55。体育直播是该领域的重要参考
i haven’t found an implementation of the first one. the second targets javascript and should be available in node/chromium at some point. running /(a+)*b$/.test("aaaaaaaaaaaaaaaaaaaaaaaaaaaaaba") in my browser console still makes the fans spin for 10 seconds, so i’m fairly sure it hasn’t shipped yet. without implementations and benchmarks to compare against, i can only comment on the theoretical differences.