How far can stack [LIFO] solve do automatic garbage collection and prevent memory leak ?

Nick Keighley nick_keighley_nospam at hotmail.com
Wed Aug 18 05:02:01 EDT 2010


On 17 Aug, 21:37, Elizabeth D Rather <erat... at forth.com> wrote:
> On 8/17/10 10:19 AM, Standish P wrote
> > On Aug 17, 12:32 pm, John Passaniti<john.passan... at gmail.com>  wrote:

> >>> It is true that the other languages such as F/PS also have borrowed
> >>> lists from lisp in the name of nested-dictionaries and mathematica
> >>> calls them nested-tables as its fundamental data structure.
>
> >> No.
>
> > you are contradicting an earlier poster from forth who admitted the
> > part on dicts.

he's saying a forth dictionary isn't a lisp s-exp. Well it isn't.

> Not at all.  A Forth dictionary is a simple linked list, not the
> complicated kind of nested structures you're referring to.  You really
> seem addicted to very complex structures.

I thought he had the opposite problem! I thought it was trying to
knock in all his programming nails with same stack-based hammer.


>  They really aren't necessary for general programming.

whaever *that* is



More information about the Python-list mailing list