As Fix To Abox

asfix2abox

Synopsis

asfix2abox [-c] [-i asfix-tree] [-o box-term] [-p table1] [-p table2] ...

Description

The asfix2box utility is a generic formatter that maps a parse-tree represented in AsFix1^? to BOX according to the pretty-print rules specified in the pretty-print tables <table1> <table2> ...

The utility accepts an ordered sequence of pretty-print tables which define mappings from language constructs to BOX expressions (See HowToDefinePrettyPrintTables). The tables are ordered such that the pretty-print rules in <table1> have higher precedence than the entries in <table2>.

The BOX term that is produced by asfix2box can be passed to one of the available back-ends to obtain a plain text, HTML, or LaTeX^? representation of your input term (See HowToPrettyPrintAGrammar).

Options

-h : display usage information. Use this option to get information on additional options

-q : run quietly

-v : display version information

Limitations

While many grammars are currently being developped in Trash.SDFII, asfix2box only accepts parse-trees of SDF1 grammars.

See also

GPP, HowToPrettyPrintAGrammar, HowToDefinePrettyPrintTables