Re: how to generate code for (a,b):=(b,a)

Dave Lloyd <Dave@occl-cam.demon.co.uk> writes:


>Hans-Juergen Boehm <boehm@mti.mti.sgi.com> wrote:
>> This doesn't make much sense to me:
>>
>> 1) Most conservative GCs are mark-and-sweep GCs.
>
>I think we differ in our terminology.


Boehm's terminology is much better, IMHO. If a conservative GC has a
mark phase and a sweep phase, just like a non-conservative
mark-and-sweep GC, then I think it makes sense to call it a
conservative mark-and-sweep GC.


> While a conservative GC works in a similar way to mark-and-sweep,
> you do not have a guaranteed set of top-level pointers as you do in
> Lisp, Algol, Fortran.


Sure you do. This guaranteed set of roots consists (normally) of the
registers, the stack, and the global data. Of course, each element of
this set is not guaranteed to be a pointer, but that's why you call it
"conservative".


--
Fergus Henderson <fjh@cs.mu.oz.au>
WWW: <http://www.cs.mu.oz.au/~fjh>
PGP: finger fjh@128.250.37.3
--

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