Convert bitmap into initial timestep for the written CA Model

Construct usable arithmetic and aggregate functions

Introduce buttons to control current timestep

Read inputted bitmaps, and check they’re in the appropriate format

Setup the LLVM environment

Have an intermediate code generator allow for the parse-trees to be read
and have the program execute when ran

Create a linker so a model can be dependent on an external model and
implement its properties

Implement a parser to produce a parse-tree representation of the code

Simulate the Cellular Automaton more efficiently, using multiple threads

Make sure for each step in the compilation process, errors are eliminated
or at least detected

Construct series of test code, with expected output bitmap given the
initial inputted bitmap

Create automated unit test program

Expand the language to be able represent a broader set of Cellular Automata

Mathematically define a general simple Cellular Automaton

Visualise each timestep using Qt

Construct a lexer to generate array of tokens for each line of code

Introduce nuanced type systems, with hierarchies of rules and states

Create various initial designs of example code following the mathematical
definition

Decide on keywords to define specific language concepts