|wanted: algorithm for Excercise 9.13 Extend Triangle with recursive ty firstname.lastname@example.org (2005-12-11)|
|Date:||11 Dec 2005 20:00:45 -0500|
|Posted-Date:||11 Dec 2005 20:00:45 EST|
Anyone ever did the excercise Excercise 9.13 Extend Triangle with
recursive type..., on page 357 of book Programming Language Processor
in Java, by David A Watt?
I wonder if a heap manager written in TAM assembly needed to alocate
memory space and do garbage collection. If so, it seems a bit huge
work. Or just use a one word memory on data store to alocate unused
heap unit for newly added list nodes.
Return to the
Search the comp.compilers archives again.