Optimal layout of a NFA-Regex is (I assume) an Hard academic Problem. Which means a library likely won't just be able to "do it for you". The CS-Fundamentals t

Optimal layout of a NFA-Regex is (I assume) an Hard academic Problem. Which means a library likely won't just be able to "do it for you". The CS-Fundamentals that underscore (Python, Perl, PRCE, and Java regexes) are the same. So this longer article may help: https://www.javaworld.com/article/2077757/core-java/optimizing-regular-expressions-in-java.html https://www.javaworld.com/article/2077757/core-java/optimizi... as while the syntax of the regex may change, the side effects and performance implications of the individual operators will not.