You can turn it into an SMT problem and solve it with a standard solver. In Haskell it's quite beautiful as you can write code that's basically identical to wri

You can turn it into an SMT problem and solve it with a standard solver. In Haskell it's quite beautiful as you can write code that's basically identical to writing a parser, and then generate inputs that satisfy the parser magically. https://github.com/ekmett/ersatz/tree/master/examples/regexp-grid https://github.com/ekmett/ersatz/tree/master/examples/regexp...