Projects, portfolio, and personal work of Joe Pelz

Rix Compiler

TODO: build compiler

The Rix Compiler is a project that was undertaken as a student at BCIT in the fall of 2015. We were a team of three students and the project came to us from an external client who was himself a developer. The language in question was meant to be easy to use like python, statically typed, and as fast and powerful as C. Our objective was to test, fix, and implement objects and single inheritance into the compiler. Incidentally, none of us had any understanding of the inner workings of compilers.

It turns out compilers are generally split into several discrete tasks. Lexical analysis, parsing, building a syntax tree, and generating code in the output language. For this project we had to touch all those areas and also manage the scope and symbol table, and type-checking. The output language was C though, so no assembly or machine code was needed, and we didn’t touch optimization in any way.

Lexical Analysis

Lexical analysis (lexing) is the process of turning a string of characters into tokens. Basically you crawl through the text files character by character and when your string of characters makes a complete token you pass it forward to the next compiler phase. An English comparison would be connecting the letters of this sentence into words, broken up by spaces and punctuated with periods and commas. The following Rix example:

  1. n = 5
  2. i for 1, n + 1
  3. print i

might be broken up into the following tokens:


The lexer has some vague idea what these tokens are, when viewed in isolation; It recognizes that = is the equality operator, and “print” is the name of some function or variable. However, the lexer has no idea which tokens relate to which others. It just converts the string of characters into a string of tokens for the next process: parsing.


Parsing takes the tokens from the lexer and connects them into combinations that start to have some meaning. It tries to match sequences of tokens against a set of patterns it recognizes. For example, in English you often form sentences out of a sequence of tokens like subject, verb, object, period. It’s not the only way to build a sentence but it’s one of the patterns the parser would match.

In Rix, the parser tries to form statements in a similar subject-verb-object format, followed by a newline. n = 5 EOL would be parsed as a complete statement in itself.

n = 5 EOL
subject verb object period

The same sort of thing would happen in i for 1, n+1, where the object itself has a nested subject-verb-object. This is I believe the most complicated sort of deterministic string processing that is done in programming. To build this entire parsing engine--and the lexer--from just C's standard library would be a great challenge and long project in itself. Gratefully, the FSF and open source community came to our rescue.

There's an app for that

There are two amazing tools out there called flex and Bison. They each take a custom rulebook you provide and compile those rules into C or C++ compatible code. From there, you can add those projects to your build and bam! lexing and parsing are done! Of course, defining the right rules is not as easy as it sounds.

Flex operates by applying regular expressions (and some more elaborate rules) to the input file to translate into tokens. Bison takes something similar to regular expressions applied to tokens to let us define recursive patterns.

this is where a language definition technique called EBNF (Extended Backus-Naur Format) comes into play. You define a symbol that represents any program, and then what that program can be made up of, similar to XML DTDs. This repeats recursively until you’re down to symbols that are made up of the tokens that the lexer is spitting out.

A simplified EBNF for Rix might look something like this:

rix-program =
statements+, EOF
statements =
class-definition | function-definition | statement | (indent, statement, unindent) | EOL
statement =
subject?, verb, object, (comma, object)*, EOL
subject =
integer | float | variable | ...
verb =
function | plus | minus | equals | ...
object =
integer | float | variable | statement | ...
function-definition =
function-header, indent, statement+ unindent
class-definition =
class-header, indent, state*, function-definition*, unindent

This is really cool! Once you have a dictionary like this, denoting what comprises what else, you can directly build a tree out of your program! You just connect the tokens until a pattern matches, then connect patterns until another pattern matches, until you can match the whole input file to a rix-program. etc. Remember that Rix code we saw earlier?

  1. n = 5
  2. i for 1, n + 1
  3. print i

it deconstructs into something like this:

Created using a JavaScript app by Miles Shang

Once the parser has processed all the tokens into Rix syntax, it’s ready to test for errors (e.g. is this variable defined in this scope?) and generate the code for output.

The results are in

After a three months of design and development, we had written a compiler that could handle:

Our client was thrilled, and after the project was complete he posted it on Reddit to get feedback from the community. It generated a lot of interesting discussion, and some less-interesting PHP bashing, and even caused Rix (called Ritchie at the time) to become one of the trending GitHub repositories!

Creation and design work is exciting

This project was a serious stretch of brain power for me and it was the most exciting project I’d worked on to that date! From learning and understanding the new topic of compiler architecture, to designing and implementing a solution to tracking scope and symbols, to figuring out a way to implement object-oriented programming in C it was an amazing experience. The compiler has plenty more growing to do, and has continued to evolve since I completed my work on it. Some of the next challenges are implementing generics, building up a standard library, and opening the language up for redefining all the built-in symbols so that Rix’s default dialect (behaviour) will be written in Rix itself and open to reimagining.

For more information, check out the project on GitHub!