Re: Inheritance Tree

OOPSLA 97 just had an article on this topic--Efficient Type Inclusion
Tests, Jan Vitek, R Nigel Horspool, & Andreas Krall. SIGPLAN Notices
v 32 n 10, Oct 97.


They discuss several alternative representations. The tree numbering
method David Chase method (they called it relative numbering) being
noted for the fact that it only works on inheritance trees, and not
DAGs, which can occur if your language supports multiple inheritance.


Anyway, this got me thinking about relative numbering. It can be
extended to work for DAGs (or even general directed graphs), although
many graphs require more than two numbers to fully disambiguate (and
cyclic graphs, which don't represent any form of inheritance I know of
form an interesting special case). It (relative numbering) turns out
to be related to the dominator problem, which means I may get a chance
to investigate it further (and then I might write it up), as I find
myself solving dominator problems quite often.


Hope this helps,
-Chris


*****************************************************************************
Chris Clark Internet : compres@world.std.com
Compiler Resources, Inc. CompuServe : 74252,1375
3 Proctor Street voice : (508) 435-5016
Hopkinton, MA 01748 USA fax : (508) 435-4847 (24 hours)
------------------------------------------------------------------------------
Web Site in Progress: Web Site : http://world.std.com/~compres
--

Return to the comp.compilers page.
Search the comp.compilers archives again.