https://www.youtube.com/watch?v=QVdBPvOOjBA New York Haskell Meetup: Brian Hurt explains a different approach, with a number of advantages, to implementing regular expressions. Despite the title, no math is actually required- so if you don't remember calculus (or never took it), that's OK. A pragmatic understanding of regular expressions is assumed however. Slides at https://github.com/bhurt/presentations.
This article explains how to generate strings based on regular expressions. To make it possible, we will use the Hoa\Compiler and Hoa\Regex libraries. The goal is twofold: first it helps to analyze regular expressions, and second we see how to visit the produced AST in order to generate strings. A bonus waits the intrepids.