Closed ihh closed 4 years ago
It would be useful to be able to create automata directly from regular expressions. Even a limited subset of features would be useful e.g.
^
$
[acgt]
.
\s
\S
\d
[^acgt]
*
+
{3,6}
\^
\$
\.
It shouldn't be too hard to build a PEG grammar parser for this e.g. with https://github.com/taocpp/PEGTL
or perhaps https://github.com/yhirose/cpp-peglib https://github.com/TheLartians/Parser
It would be useful to be able to create automata directly from regular expressions. Even a limited subset of features would be useful e.g.
^,$[acgt].,\s,\S,\d...[^acgt]*,+{3,6}\^,\$,\....It shouldn't be too hard to build a PEG grammar parser for this e.g. with https://github.com/taocpp/PEGTL
or perhaps https://github.com/yhirose/cpp-peglib https://github.com/TheLartians/Parser