A tiny compiler for a simple synthetic language featuring LL(2) grammar, written in pure C

The compiler consist of typical parts, known as:

• Lexer (lexer.h)
• Parser (parser.h)
• Assembler like code generator (generator.h)
• Virtual machine (virtual_machine.h)
• Symbol table (symbol_table.h)
• Abstract syntax tree (ast.h)

The compiler is implemented for educational purposes. Some parts are simplified for the sake of better understanding

Build

$ gcc main.c -o compiler

Usage

$ ./compiler source

An example program for Pythagorean theorem:

cath1 = 3;
cath2 = 4;
hypsquare = cath1 * cath1 + cath2 * cath2;

Execution result:

hypsquare = 25

Generated ASM:

PUSH 3
WRITE cath1
PUSH 4
WRITE cath2
READ cath1
READ cath1
MUL POP, POP
READ cath2
READ cath2
MUL POP, POP
ADD POP, POP
WRITE hypsquare

The language description in EBNF:

program = expr, ";", { program } ;
expr = id, "=", expr | ("+"|"-"), term, { ("+"|"-"), term } ;
term = factor, { ("*"|"/"), factor } ;
factor = "id" | "num" | (expr) ;