Commit | Line | Data |
---|---|---|
4dd335d4 JM |
1 | .TH ml-burg 1 "November 14, 2002" |
2 | .SH NAME | |
3 | ml-burg \- a tree parser generator for Standard ML | |
4 | .SH SYNOPSIS | |
5 | .B ml-burg | |
6 | .IR file .burg | |
7 | .br | |
8 | .SH DESCRIPTION | |
9 | This manual page documents briefly the | |
10 | .B ml-burg | |
11 | command. | |
12 | This manual page was written for the Debian distribution | |
13 | because the original program does not have a manual page. | |
14 | ||
15 | The | |
16 | .B ml-burg | |
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. | |
25 | ||
26 | When | |
27 | .IR ml-burg " is presented with " file ".burg, the file " file ".sml" | |
28 | is generated. | |
29 | .SH SEE ALSO | |
30 | .BR sml (1), | |
31 | .BR ml-lex (1), | |
32 | .BR ml-yacc (1), | |
33 | .BR ml-makedepend (1), | |
34 | .BR ml-build (1). | |
35 | .br | |
36 | The programs are documented fully by | |
37 | .IR "The ML-Burg -- Documentation" ", Florent Guillaume and Lal George, " | |
38 | which is available in | |
39 | .IR /usr/share/doc/ml-burg/doc.pdf . | |
40 | .SH AUTHOR | |
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) |