Implementing Dynamic Typing with Tagged Unions
Many scripting languages, if not most of them, have dynamic typing. where you don’t need
Compiling Regular Expressions with Non-deterministic Finite Automata
Regular expressions: those seemingly non-sensical strings of characters that seem to magically take an input
Compiler Construction: Lexical Analysis.
If you’ve been following along with my latest series of posts, then welcome to part
Exploring Stack Machines: Compiling high level languages to Stack Machine code
At the end of my previous article we had a fully featured stack machine that
Exploring Stack Machines: One Stack Good, Two Stacks Better.
In my previous post I gave a brief history of stack machines, what they are and