Projects

Ragel

Ragel compiles finite state machines from regular languages into executable C, C++, Objective-C, D, Java or Ruby code. Ragel state machines can not only recognize byte sequences as regular expression machines do, but can also execute code at arbitrary points in the recognition of a regular language. ... [More] Code embedding is done using inline operators that do not disrupt the regular language syntax. [Less]

TenDRA

TenDRA is a three clause BSD-licensed C and C++ compiler.

Lestes

Project Lestes is an ongoing effort to make a C++ compiler with comprehensive C++ source code using the most advanced algorithms seen. Other goals include: easilly retargettable compiler, compiler that can be successfully used in teaching compiler construction, compiler that can compile multitude of languages.

freecc

A parser/lexer generator written in Java. This is a development fork of the well known JavaCC parser generator originally developed at Sun Microsystems.

akuma

A toolchain consisting of a C compiler and various tools for binary object handling.

da4044

Practical assigment for course da4044

cocuyo

Cocuyo es un framework que facilita el desarrollo de software utilizando lenguajes de dominio específico (DSL), puesto que brinda un conjunto de herramientas, librerias y lenguajes que permiten la creación de compiladores e intérpretes, la comunicación entre lenguajes y la generación de documentos de texto.

compiler-in-d

The following is a Compiler for a completely artificial c-like language.

icycrystal

This is a compiler for a small part of the C language. I'm trying to get it to compile to very simple intermediate language, while adding small features step by step, then when I have enough features I'll make the real assembly generation. (Instead of aiming too high and having a perfect ... [More] parser and say, no code generation) Update: June 16, 2009During the past days I've been heavily working on the IML generation. I've implemented a conservative register allocation algorithm. The IML generation is very limited though. Still do not have any generation to call functions. Notice that the IML is still fairly high level ( accessing local variables by name rather than stack offset ). Input:int main(int testParameter) { int a = 3; int b = 4; int c = a + b; }Output:Globals: Text: main: push ebp mov esp, ebp sub 12, esp mov 3, r0 mov 4, r1 mov r1, b add r0, r1 mov r0, a mov r1, c mov ebp, esp pop ebp ret [Less]

OILexer

OILexer is a LL parser generator for C# aimed at simple language parsing for language enthusiasts. Does not use recursive descent or bottom-up parsing methods, but rather, a top-down deterministic model is employed. This is a portion of the Abstraction Project.