BNF-grammars

Next: pseudo-C-preprocessor Prev: revised-sectioning Up: april91-new-ideas Top: Top

0.9.1.5. A "BNF grammar" environment

This would work like the `verbatim' program used with the Haskell report; you could say:

\begin{grammar}
exp -> aexp                             

    |  exp aexp

    |  exp_1 op exp_2

    |  @-@ aexp

    |  @\@ apat_1 ... apat_n [gd] @->@ exp

    |  @if@ exp_1 @then@ exp_2 @else@ exp_3

    |  exp @where@ @{@ decls @}@

    |  @case@ exp @of@ @{@ alts @}@

    |  exp @::@ [context @=>@] atype

\end{grammar}

and respectable BNF-looking stuff would appear in your output. Index entries for the definitions of nonterminals would be generated; possibly a `[noindex]' option to suppress that.

I'd also like to do something for inference rules, but I'm fairly baffled about what that might be. (They can be mightily complicated, and it's not clear that a plain-ASCII form is possible.)