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

Standish P stndshp at gmail.com
Sat Aug 21 07:36:18 CEST 2010


On Aug 18, 8:05 pm, Elizabeth D Rather <erat... at forth.com> wrote:
> On 8/18/10 2:23 PM, Standish P wrote:
>
> > On Aug 17, 6:38 pm, John Passaniti<john.passan... at gmail.com>  wrote:
>
> >> You asked if Forth "borrowed" lists from Lisp.  It did not.  In Lisp,
> >> lists are constructed with pair of pointers called a "cons cell".
> >> That is the most primitive component that makes up a list.  Forth has
> >> no such thing; in Forth, the dictionary (which is traditionally, but
> >> not necessarily a list) is a data structure that links to the previous
> >> word with a pointer.
>
> > Would you show me a picture, ascii art or whatever for Forth ? I know
> > what lisp lists look like so I dont need that for comparison. Forth
> > must have a convention and a standard or preferred practice for its
> > dicts. However, let me tell you that in postscript the dictionaries
> > can be nested inside other dictionaries and any such hiearchical
> > structure is a nested associative list, which is what linked list,
> > nested dictionaries, nested tables are.
>
> You indicated that you have a copy of Forth Application Techniques.
> Sections 8.1 and 8.2 cover this topic, with some drawings.

Can someone send me a scan copy of sec 8.1 to 8.2 within the exemption
in the copyright law for my personal study and evaluation of the book
only.

I have only looked at the book cover on forth site and its table of
contents on amazon.

why elase would I ask where it is if I had a copy and would go
directly to index assuming it has a good indexing.

Alternative, a link to an open source of explanation would be
requested.




More information about the Python-list mailing list