[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
- To: Common-Lisp-Object-System@sail.stanford.edu
- Subject: Class-precedence-list computation
- From: David A. Moon <Moon@STONY-BROOK.SCRC.Symbolics.COM>
- Date: Mon, 26 Jan 87 23:54 EST
- In-reply-to: <870126005535.5.MOON@EUPHRATES.SCRC.Symbolics.COM>
Status update on this:
Date: Mon, 26 Jan 87 00:55 EST
From: David A. Moon <Moon@STONY-BROOK.SCRC.Symbolics.COM>
Dick, your algorithm does not produce the same results as the Flavors....
the most productive thing for me to do next would be to think about a
coherent statement of that Flavors rule designed to fit into the framework
of Dick's explanation of class precedence computation, where the preorder
treewalk is now.
I've tried several ideas for this but haven't found one that works yet.
I'll keep at it.
I haven't tried coding Danny's algorithm (proposed a month or two ago)
yet. I wonder if it does the same thing as either of these other
I've been playing around with this (code from Gregor's message of Dec 2).
It usually does what I consider the right thing, but sometimes it does
something different from both Gabriel and Flavors; I haven't been able
to boil that down to a small test case yet. The Bobrow algorithm also
goes into an infinite loop in some cases (again, not yet boiled down to
a simple case). I don't know for sure whether it's truly an infinite
loop or just a combinatorial explosion; I gave up after a minute or so
in one case, and after a few seconds in several other cases (normally the
algorithm takes much less than a second).