Compiler & Parser Studies - Tom & Sara Novelli

I've been studying parser and compiler techniques since 1998, on and off. (I confess to having dreamt of creating my own language and acheiving world domination :-)

I dabbled with Forth, Small C, Tiny C, Python, Javascript, Ruby, Lisp/Scheme... My general impression is that algebraic notation and other "syntactic sugar" is helpful, as long as semantics come first (as in Lisp) and the syntax is consistent (C, JS, Python). I'm trying to show that a language with nice syntax can be implemented just as simply and efficiently as a language without syntax.

Current projects...

Python/Javascript/etc-to-Lisp parser based on ``META-II'' [Schorre64, Baker91] and ``Precedence Climbing'' techniques
Lisp/Scheme-to-machine-code compiler (a toy implementation for practice, nothing earth-shattering here :-)

-- Tom Novelli, June 2008

Older files

Filename	Size	Description
ac1.tgz	4130	Topdown parser in Assembly (NASM) for Linux
ac2.tgz	5436
ac3.tgz	6618
fc1	2335	Written in Forth
fc2	2960
meta/
prec3.py	2924	“Precedence Climbing” parser test in Python
prec3.scm	4046	“Precedence Climbing” parser test in Scheme