wanted: algorithm for Excercise 9.13 Extend Triangle with recursive type..., on page 357 of book Programming Language Processor in Java, by David A Watt

js035288@nims.paisley.ac.uk
11 Dec 2005 20:00:45 -0500

          From comp.compilers
Related articles
wanted: algorithm for Excercise 9.13 Extend Triangle with recursive ty js035288@nims.paisley.ac.uk (2005-12-11)
| List of all articles for this month |
From: js035288@nims.paisley.ac.uk
Newsgroups: comp.compilers
Date: 11 Dec 2005 20:00:45 -0500
Organization: http://groups.google.com
Keywords: question, analysis
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.

Thanks

Post a followup to this message

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