diff options
| author | Franciszek Malinka <franciszek.malinka@gmail.com> | 2022-03-15 03:17:35 +0100 |
|---|---|---|
| committer | Franciszek Malinka <franciszek.malinka@gmail.com> | 2022-03-15 03:17:35 +0100 |
| commit | b26f966a6ba9f753d4bec8094b7d1bd5f7d0838e (patch) | |
| tree | 7343a2b89334a92997e76fa843b49f7bad99b461 /README.md | |
| parent | 50c6e603151f585fd172402b496fef31a849c2ad (diff) | |
Diffstat (limited to 'README.md')
| -rw-r--r-- | README.md | 7 |
1 files changed, 5 insertions, 2 deletions
@@ -7,6 +7,9 @@ structures, thus I'd like to get the hang of writing small programs fast. DFA to regex converter. TODO: - Reduce regexes that are concatenated with the empty regex + - Try adding more simple rules for reducing, for example `(e+a)((a*)(b)) == (a*b)` - Expand the string_of_regex function, for example omit parenthesis around - concatenated letters -- Make some automaton parser
\ No newline at end of file + concatenated letters (not as easy as I thought) +- Make some automaton parser + +It created a not-so-long regex such that some online regex-to-dfa converter has successfully converted to DFA. Regex can be found in [results](/results).
\ No newline at end of file |