From: Jeff Furman
Subject: Does John Allen's nonrecursive READ work?
Date:
Message-ID: <3783FC20.4B025F64@cisco.com>
In The Anatomy of Lisp, John Allen shows an algorithm for a tree walking
(or growing) Sexpression reader. I have consistently failed to cause
that algorithm to read Sexpressions. Does anyone know of errata, or a
worked example of a working implementation? It is a tantalizing idea to
turn the Deutsch-Schorr-Waite traversal algorithm 'inside out' to
implement such a reader. One can use the traversal to print, stack free
and also print recursive structures.
please ··········@ocs.net
Thanks, Jeff.