A better idea, if someone is *that* interested, would be to sit down
and write a compiler for the TADS language that produces Z machine
output. That would probably be easier to do, would be much more
useful, and would also effectively put an end to the debate over
having TADS vs. Z machine divisions in next year's contest....
-- PTD --
(Doesn't the TADS manual include a BNF grammar for the language?)
----- Palmer T. Davis <palmer@ansoft.com> Ansoft Corporation, Four Station Square, Suite 660, Pittsburgh, PA 15219 http://www.ansoft.com/palmer/home.html