A while back I wrote a little Rust library that does exactly what you say: parses a regex to use as a text generator. It was a lot of fun, and really gives you an appreciation for just how much bigger than ASCII matching the regex world can be! Writing a constraint-based solver that uses the generator library sounds like an amusing project as well!

Link: https://github.com/CryptArchy/regex_generate