Compiling a Functional Language to Turing Machines - Part 4
With the AAST simplified, the only step remaining is generating the actual turing machine. The first step was to create a new data structure for holding the ...
Recent Posts
Compiling a Functional Language to Turing Machines - Part 3
Since the last post I ended up simplifying the type and ownership checking greatly. One of the changed was to make the following transformations to the AST b...
Compiling a Functional Language to Turing Machines - Part 2
The first step I took on the compiler was to write the Extended Backus-Naur Form (EBNF) grammar for the language. You can check it out here.
Compiling a Functional Language to Turing Machines - Part 1
This semester I have been studying Computer Theory, and I had the idea of writing a compiler which generates Turing Machines. I started by designing the lang...
Implementing Serialization for a C++ Game Engine - Part 2
After my previous post, what remained to be done regarding the serialization system was: finding a way for the serializer to known if an object type has a...