Related articles |
---|
data allocation in interpreters weltraum@astrocat.de (2006-05-30) |
Re: data allocation in interpreters pjb@informatimago.com (Pascal Bourguignon) (2006-05-30) |
Re: data allocation in interpreters haberg@math.su.se (2006-06-03) |
Re: data allocation in interpreters georgeps@xmission.com (George Peter Staplin) (2006-06-03) |
Re: data allocation in interpreters gmt@CS.Arizona.EDU (2006-06-07) |
From: | Pascal Bourguignon <pjb@informatimago.com> |
Newsgroups: | comp.compilers |
Date: | 30 May 2006 23:25:13 -0400 |
Organization: | Informatimago |
References: | 06-05-091 |
Keywords: | storage, interpreter |
Posted-Date: | 30 May 2006 23:25:13 EDT |
weltraum@astrocat.de writes:
> What are common techniques for data allocation (strings, high-level
> data structures) in interpreters? I could think about:
>
> - malloc / free with trying to free unused data as soon as possible.
> - same as above with some custom implementation of malloc / free (which
> one?)
> - full blown grabage collector.
> - somthing hybrid (how?)
>
> What do you think, how is it implemented in the famous interpreters?
Depends on the programming language.
If you consider an interpreter for C, you'll probably won't have a
garbage collecetor included, since the purpose of C is to compute
addresses and use malloc/free (or is it? cf BoehmGC).
But in most other programming languages, there's a garbage collector.
--
__Pascal Bourguignon__ http://www.informatimago.com/
Return to the
comp.compilers page.
Search the
comp.compilers archives again.