Open bogdan2 opened 8 years ago
Thank you for reporting this!
Project Fare turns Regular Expressions into Automatons by applying the algorithms of dk.brics.automaton and xeger.
Unfortunately, I don't have an answer to your question, as Project Fare is really a port of the above Java projects. – We'd have to try \p{L}
, \p{N}
, and \p{Lu}
in Java and compare the results.
You may use a different pattern or use a different engine to reverse the Regular Expression into an Automaton. As an example, you can use the Rex engine.
Hello:
Just to let you know that I tried to use Xeger to generate random strings based on \p{L}, \p{N}, and \p{Lu} and they don't seem to be supported.
Is there a way to use them?
Thanks