Jeff Dalton <firstname.lastname@example.org> wrote:
| Peter Seibel <email@example.com> writes:
| > you're going to have a hard time representing abstract syntax trees in
| > a way that's convenient for macros to operate on them.
| I'm not so sure about that. A subexpression can still be
| a sublist. Imagine that [ ... ] was a notation for vectors
| in Lisp. Here's an example expression:
| [if [> x y] [f x] [f [g x]]]
| All those lists could be vector-based lists.
See my reply elsewhere in this thread on the problems that creates
with PROGN bodies:
[progn [f x] [foo bar] [f [g x]] [baz gorp] [quxx blat]]
(Hint: What must be saved +-- here to get back from the call to "f"?)
Rob Warnock <firstname.lastname@example.org>
627 26th Avenue <URL:http://rpw3.org/>
San Mateo, CA 94403 (650)572-2607