On Tue, Sep 17, 2002 at 03:37:58PM -0400, Andrew Cagney wrote:
>>Depends on how you grow it :-) Something like (assuming a real language
>>:-):
>> D:
>> 0: x, z
>> 1: x, y (from C)
>> 2: ...
>
>
>How you intend to do this efficiently I don't know.
By efficiency did you mean speed or memory? I don't see speed being an
issue (except for the global table), just memory (GDB's foot print growing).
Either. It's quite a hard problem, which is a reason why C++ compilers
generally use Koenig lookup through multiple blocks rather than growing
blocks. And there's all sorts of other correctness issues.
{I'd better find out what a koenig lookup is. I think I just tried to
described one :-)