In this post, we write the compiler for our AST to bytecode, and a decompiler for the bytecode.
In this series of posts, we write a fast bytecode compiler and a virtual machine for arithmetic in Haskell. We explore the following topics:
In this series of posts, we write a fast bytecode compiler and a virtual machine for arithmetic in Haskell. We explore the following topics:
Parsing arithmetic expressions to Abstract Syntax Trees (ASTs).
Unit testing for our parser.
Interpreting ASTs.
Compiling ASTs to bytecode.
Disassembling and decompiling bytecode.
Unit testing for our compiler.
Property-based testing for our compiler.
... continue reading