Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!usc!zaphod.mps.ohio-state.edu!swrinde!ucsd!ucbvax!MITCH.ENG.SUN.COM!wmb
From: wmb@MITCH.ENG.SUN.COM
Newsgroups: comp.lang.forth
Subject: Re: STRIPPERS
Message-ID: <9102121526.AA24242@ucbvax.Berkeley.EDU>
Date: 11 Feb 91 19:33:57 GMT
Sender: daemon@ucbvax.BERKELEY.EDU
Reply-To: wmb%MITCH.ENG.SUN.COM@SCFVM.GSFC.NASA.GOV
Organization: The Internet
Lines: 26

> was made to a "stripper" program.  A stripper removes all words not used
> within a given application.  Has anybody developed/used such a program?

Yes, many vendors have such a tool.

>       Method 2.
>
>       The stripper compresses a running forth system.

That's how mine works.

>       and fixes up all references to this words.  Obviously, this
>       part of the task is more difficult if you opt for subroutine
>       threading and inline code.

Not really.  Any threading technique other than token threading is about
equally difficult to relocate the references.  It helps a lot to have a
relocation bitmap identifying which memory locations contain pointers.

>       A disadvantage of this method is that
>       it requires enough memory to hold the unstripped application
>       plus the stripper program.

The stripper program, although rather complex, is not all that big.

Mitch Bradley, wmb@Eng.Sun.COM