1 .TH ml-burg 1 "November 14, 2002"
3 ml-burg \- a tree parser generator for Standard ML
9 This manual page documents briefly the
12 This manual page was written for the Debian distribution
13 because the original program does not have a manual page.
17 program generates a Standard ML program to perform bottom-up rewriting
18 of an input tree. Cost information associated with each rewrite rule
19 is used to derive the minimum rewrite cost for the entire tree. A
20 successful reduction corresponds to rewriting the input tree to a
21 special non-terminal symbol called the
22 .IR "start non-terminal" .
23 Upon successful reduction, facilities are provided to walk the tree
24 emitting semantic actions corresponding to the rules that matched.
27 .IR ml-burg " is presented with " file ".burg, the file " file ".sml"
33 .BR ml-makedepend (1),
36 The programs are documented fully by
37 .IR "The ML-Burg -- Documentation" ", Florent Guillaume and Lal George, "
39 .IR /usr/share/doc/ml-burg/doc.pdf .
41 This manual page was written by Aaron Matthew Read <amread@nyx.net>,
42 for the Debian GNU/Linux system (but may be used by others)