SCT Implementation
Appendix SCT implementation In this appendix code is presented for an implementation of SCT evaluat ion together with t he grammar definit ions from t his book. T he implement ation is separated into three programs. The first is an awk script used to generate Standard ML code for sequence assign ments. The second is a Standard ML program providing t he SCT evaluation routine. The third is a Standard ML program containing the grammar definitions. Information on using t hese programs is also given. A wk script to generate sequence assignments { print " (*the as signment data t ype*) " for (i = 1; i <= NF ; i++) printf("'l,s%s:fol list%s", i == 1 ? \ ''type assn= { '' : '''' , $ i , i < NF ? "}\n\n" ) print '' (* the empty assignment *) '' for (i = 1; i <= NF; i ++) printf ( "%s%s=nil %s ", i == 1 ? \ "val assnO:assn = { " : 11 11 , $i, i < NF ? "}\ n\n") print '' ( * t he err or assi gnment *) u for (i = 1; i <= NF ; i ++) printf("%s%s= [Error \"%s error\"]%s", i == 1 ? \ "val assnError: assn = {" : "", $i, $i , i < NF? ", " : "}\ n\ n") print '' (* v returns t he sequenc e v alue g assigns t o name *) '' for (i = 1; i <= NF; i ++) printf("%s\"%s \ " => #%s g%s " , i == 1? \ "f un v (name : st ring, g :assn):fol list =\n (case name\n of \ $i , $i, i < NF ? " I " : " I _ => nil)\n\n" ) 205 206 THE SEMANTICS OF GRAMMATICAL DEPENDENCIES print"(* vtop returns the frontmost value of the s equence g assigns name *) " print "fun vtop (name:string, g:assn) :fol _,, pri nt '' if v ( name, g) = nil'' print then Error (name-\" error\") else hd (v
[Show full text]