Regular expressions define languages over alphabets. This tool enumerates the strings in such a language. Since regular expressions typically describe infinite languages, the enumeration must be bounded by a maximum word length and a finite alphabet. The generator uses the regular expression syntax supported by Rust’s regex crate.
Built with regex-strings, a Rust crate for enumerating the strings a regular expression matches.
0 words
Powered by regex-strings + WebAssembly. Runs entirely on your device.