This project's aim is to build a graph engine, that is able to build and compare graphs - and to match patterns and apply actions on the graph, to effectively use it as a graph-transformation framework.
I did some evaluation and didn't get an error, but like already at the second regular expression, it didn't run through, because the boolean java.lang.String.matches(String regex) didn't terminate in any reasonable time. It just seems that it isn't made for such long regular expressions.
My expressions may have some unnecessary parentheses, but that can't be the reason why it's so slow. If the results were wrong, it would just give negative results, though. I don't exactly know what's going on here.
I did some evaluation and didn't get an error, but like already at the second regular expression, it didn't run through, because the
boolean java.lang.String.matches(String regex)didn't terminate in any reasonable time. It just seems that it isn't made for such long regular expressions.My expressions may have some unnecessary parentheses, but that can't be the reason why it's so slow. If the results were wrong, it would just give negative results, though. I don't exactly know what's going on here.