Cactus stack

I would be interested in any references you unearth for this concept as we are
about to support this sort of parallelism in our Algol 68 and Fortran 90
compilers - particularly on transputers!


The earliest reference I know of is from the Simula67 language which used a
statically organised cactus stack to handle its co-routines. But I expect the
idea was around somewhat earlier. I'm not sure when the dynamically organised
cactus stacks first appeared but Algol68 is predicated on them! M. Griffiths
in the excellent book "Compiler Construction" (ed. Bauer and Eickel) describes
a heap based implementation but there is no specific reference in the biblio.


The occam style transformations and optimisations are well understood but I
have seen very little reference to the class of optimisations which allow the
general dynamic form to be reduced to a static form - at least local to some
scope. Can anyone point me to any useful references here?


Regards,
----------------------------------------------------------------------
Dave Lloyd Email: Dave@occl-cam.demon.co.uk
Oxford and Cambridge Compilers Ltd Phone: (44) 1223 572074
55 Brampton Rd, Cambridge CB1 3HJ, UK
--

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