Have you seen Reggie lately? I wrote this Dismantling Reggie[^] which covers how Reggie works. The thing is, Norm works the same way, but instead of FA state machines for lexers and matchers, it writes PDA state machines for parsers. It's shockingly similar, so understanding how Reggie works will make understanding Norm par for the course. As far as understanding the process of generating the parse tables that the code is generated from, I've covered that in several previous articles and I won't be covering it that much when I cover Norm, any more than I covered the workings of the regular expression engine when covering Reggie. I'm just putting that out there FWIW, and so you know what to expect.
Real programmers use butterflies