[Prev][Next][Index][Thread]
A simple SSA-based compiler written in Dylan
-
To: info-dylan@ai.mit.edu
-
Subject: A simple SSA-based compiler written in Dylan
-
From: housel@acm.org (Peter S. Housel)
-
Date: Fri, 15 Sep 2000 14:51:52 -0700
-
Sender: owner-info-dylan@ai.mit.edu
-
User-Agent: Wanderlust/1.1.1 (Purple Rain) WEMI/1.13.7 (Shimada) FLIM/1.13.2 (Kasanui) Emacs/20.7 (i386--freebsd) MULE/4.0 (HANANOEN)
During the winter 2000 quarter, I took an advanced compiler
construction class taught by my graduate advisor Michael Franz. The
term project required us to write a compiler for a simple
Pascal-subset called p2k. The compiler had to parse the source
language and generate an SSA (Static Single Assigment) intermediate
form on which it would perform common subexpression elimination and
register allocation.
Everyone has probably turned in their assignment by now, so I'm making
mine, written in XML-based literate Dylan code, available on my
"Projects" web page, http://members.home.com/housel/projects.htm (near
the bottom of the page).
Note that I had to censor part of the program, at least until after
February 18, 2003, because it infringes on US patent number
4,571,678 assigned to the IBM corporation. I hate patents.
It's been compiled with both d2c and Functional Developer (at some
point).
Literate programs need literary critics, and any input would be
appreciated.
-Peter S. Housel- housel@acm.org http://members.home.com/housel/
Follow-Ups: