Robin Tarsiger is a user on mastodon.technology. You can follow them or interact with them if you have an account anywhere in the fediverse.
If you don't, you can sign up here.
Also, https://matklad.github.io/2018/06/06/modern-parser-generator.html is worth a read even if you're only kind of interested in parsers. There's epiphanies in it. Like:
Regular languages (regex's) are state machines with a fixed memory space.
Full Turing machine languages are state machines with two stacks of memory space (moving the Tape is popping an item from one stack and pushing it to the other).
Context-free languages are exactly in the middle: they're state machines with one stack.
I don't know what it means but it's deep.
@icefox Interesting. FWIW, the "epiphany" you mention was covered pretty thoroughly in undergrad CS formal theory class.
@dasyatidprime I never got that far! And all the parser theory I learned (or at least that I remember) is from reading books about the compilers. They go *fairly* deep into the theory but that one bit never seems to have struck me before now.
Besides, being a well-documented epiphany doesn't make it less of an epiphany! :-P