🚀 go-pugleaf

The concrete syntax of fuzz differs slightly from the one LaTeX produces
from specifications (e.g. fuzz syntax contains the string "\forall"
where LaTeX produces the quantor symbol itself, schemas are more
complicated examples).

These differences can be utilized to some extent. If you want the
(unparenthesized) argument to a function written as subscript you can
get this by defining:

	\newcommand{\f}[1]{f_{#1}}
	\begin{gendef}[INDEX]
	\f : INDEX \fun \nat \pfun \nat
	\end{gendef}

Recently I tried to define strings like this:

	\begin{zed}
	LETTER ::= a|b|c|d \\
	STRING ::= string \ldata \seq LETTER \rdata
	\end{zed}
	
Now I'm looking for a way to tell LaTeX what strings shall look like
and which will be accepted by fuzz. The following approach would be
treated properly by fuzz, but the LaTeX definition does only do half 
of the job.

	\newcommand{\str}[1]{"#1"}
	%%\begin{zed}
	%%\str == string
	%%\end{zed}

	\begin{axdef}
	s: STRING
	\where
	s = string \langle a, b \rangle \\
	s = \str {\langle a, b \rangle}
	\end{axdef}

Any idea?

-- 
+------------------------------------------------------------------------
| Martin Carstensen, Koblenz University         cash@infko.uni-koblenz.de
|        Department of Computer Science         Voice: +49 261 9119-423
|        Rheinau 3-4, D-5400 Koblenz, Germany   Fax:   +49 261 9119-499