[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
A Bit More on Lambda-List Parsing
- To: "common-lisp" <common-lisp@su-ai.ARPA>
- Subject: A Bit More on Lambda-List Parsing
- From: "BACH::GREEK" <firstname.lastname@example.org>
- Date: Mon, 21 Jul 1986 18:04:00 -0000
- Reply-to: "BACH::GREEK" <email@example.com>
We've been off the network for a while, so I couldn't get in my two
cents on the issue of lambda lists and their parsing/representation.
If it's officially too late to comment, I apologize.
Why not define a function called PARSE-LAMBDA-LIST which takes
a lambda list and some information about what is allowed in it?
This function would parse the lambda list and return a structure (!).
This structure would contain all of the detailed information about
the lambda list, what was in it, whether &ALLOW-OTHER-KEYS was there,
blah, blah, blah.
There would also be a function that returned the structure describing
the lambda list for a given function (or macro, why not?). We could
design the structure so that each slot could either contain the
appropriate information or a value meaning "I don't know". In this
way, implementations which don't remember certain information
could indicate this.