Related articles |
---|
burg with n-ary trees? galmasi@leo.cs.uiuc.edu (George Almasi) (2000-02-10) |
Re: burg with n-ary trees? raugfer@uol.com.br (Rodrigo Augusto B. Ferreira) (2000-02-12) |
Re: burg with n-ary trees? zucco@my-deja.com (Tom Harwood) (2000-02-12) |
Re: burg with n-ary trees? vmakarov@cygnus.com (Vladimir Makarov) (2000-02-12) |
Re: burg with n-ary trees? danwang+news@cs.princeton.edu (Daniel C. Wang) (2000-02-12) |
From: | "Daniel C. Wang" <danwang+news@cs.princeton.edu> |
Newsgroups: | comp.compilers |
Date: | 12 Feb 2000 22:40:48 -0500 |
Organization: | Princeton University |
References: | 00-02-039 |
Keywords: | tools |
George Almasi <galmasi@leo.cs.uiuc.edu> writes:
> Has anyone modified burg/iburg to accommodate n-ary trees?
ML-burg available at
ftp://ftp.research.bell-labs.com/dist/smlnj/release/110/
which used to be part of SML/NJ compiler but is no longer used. (Maximal
munch seems to be just as good.)
builds iburg like tree pattern matchers for ML and supports n-ary trees.
Depending on your application this might just do the trick, unless you're
really want to have C code.
See http://cm.bell-labs.com/cm/cs/what/smlnj/index.html for more info about
SML/NJ
Return to the
comp.compilers page.
Search the
comp.compilers archives again.