Re: Historical Implementations to Garbage Collectors

Robin Vowels schrieb:
> From: "George Neuner" <gneuner2@comcast.net>


>> Pointer:length pairs permit multiple use of substrings, but don't
>> permit constructing a new string from arbitrary pieces of existing
>> ones. The tree representation can permit completely arbitrary
>> substring sharing.
>
> The overheads of that would be intolerable. The address-length
> pair is simple to use, can be passed easily as an argument
> (and returned easily from a function), and there is -- essentially --
> no overhead until the dynamic string space gets used up,
> after which garbage collection is necessary.


Just a note:


I found tree representations for strings in editors, implementing
unlimited Undo. Obviously such applications are not related to small
memory nor to garbage collection.


DoDi

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