Greetings! Just thought I'd post a description of something that would be useful in the GCL compiler:
Take a fully macroexpanded form, recursively descend looking for maximal repeated forms (under equalp) at the highest level at which all referred variables are lexically bound, call some (external) function to determine if the form is side-effect-free, then if so, replace the form with `(let ((,sym ,form)) ,@(sublis '((,form . ,sym)) body)). Anyone know of anything like this already written somewhere? Take care, -- Camm Maguire [EMAIL PROTECTED] ========================================================================== "The earth is but one country, and mankind its citizens." -- Baha'u'llah _______________________________________________ Gcl-devel mailing list Gcl-devel@gnu.org http://lists.gnu.org/mailman/listinfo/gcl-devel
