ML-BURG(1) ML-BURG(1) NAME ml-burg - a tree parser generator for Standard ML SYNOPSIS ml-burg file DESCRIPTION The ml-burg program generates a Standard ML program to perform bottom-up rewriting of an input tree. Cost information associated with each rewrite rule is used to derive the minimum rewrite cost for the entire tree. A suc- cessful reduction corresponds to rewriting the input tree to a special non-terminal symbol called the start non-terminal. Upon successful reduc- tion, facilities are provided to walk the tree emitting semantic actions corresponding to the rules that matched. AUTHOR ML-Burg was written by Lal George and Florent Guillaume. SEE-ALSO sml(1) ML-Burg -- Documentation by Florent Guillaume and Lal George (included in the SML/NJ documentation). COPYING Copyright (C) 2020 The Fellowship of SML/NJ This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PUR- POSE. SML/NJ 2024-10-25 ML-BURG(1)
Want to link to this manual page? Use this URL:
<https://man.FreeBSD.org/cgi/man.cgi?query=ml-burg&sektion=1&manpath=FreeBSD+Ports+15.1.quarterly>