Related articles |
---|
Announce: BURG for OCaml lindig@eecs.harvard.edu (Christian Lindig) (2002-03-09) |
From: | Christian Lindig <lindig@eecs.harvard.edu> |
Newsgroups: | comp.compilers |
Date: | 9 Mar 2002 03:02:26 -0500 |
Organization: | Harvard University, Cambridge, Massachusetts |
Keywords: | code, tools, available |
Posted-Date: | 09 Mar 2002 03:02:26 EST |
The C-- compiler project releases internal development tools.
http://www.cminusminus.org/tools.html
OCamlBurg 1.0
OCamlBurg is a code generator generator for Objective Caml
(http://www.ocaml.org/): it takes a pattern matching specification and
generates a dynamic-programming algorithm that implements the matching.
Unlike an ML pattern, a Burg pattern covers only part of a tree. Dynamic
programming finds at run time the cheapest way to cover a tree with
patterns. The typical application is inside a compiler to translate an
expression tree into code that evaluates the expression at run time.
OCamlBurg is inspired by Fraser, Hanson, and Proebsting's IBurg
implementation for C (http://www.cs.princeton.edu/software/iburg).
OCamlBurg is implemented as a literate program with the Noweb tool
(http://www.eecs.harvard.edu/~nr/noweb) and comes with everything to
compile it from source code. The documentation is in HTML and Unix
manual page format. OCamlBurg is released into the public domain.
Christian Lindig <lindig@eecs.harvard.edu>
Norman Ramsey <nr@eecs.harvard.edu>
--
Christian Lindig Harvard University - DEAS
lindig@eecs.harvard.edu 33 Oxford St, MD 242, Cambridge MA 02138
phone: +1 (617) 496-7157 http://www.eecs.harvard.edu/~lindig/
Return to the
comp.compilers page.
Search the
comp.compilers archives again.