Path: utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!uunet!zaphod.mps.ohio-state.edu!usc!ucsd!ucbvax!UUNET.UU.NET!vme131!lsiserv1!pl
From: vme131!lsiserv1!pl@UUNET.UU.NET (Pedro Sanchez)
Newsgroups: comp.lang.forth
Subject: Granularity of Forth Programs
Message-ID: <9101241516.AA11654@ucbvax.Berkeley.EDU>
Date: 24 Jan 91 14:03:10 GMT
Sender: daemon@ucbvax.BERKELEY.EDU
Reply-To: Pedro Sanchez <vme131!lsiserv1!pl%UUNET.UU.NET@SCFVM.GSFC.NASA.GOV>
Organization: The Internet
Lines: 26

I was wondering of what would be the ideal granularity of Forth programs.

Certainly we can define several ways of measuring such granularity.
A possible measure could be the mean number of words in the definition of
the several words that compound a given program.

I would like to know from you guys any comments about this subject, and
what are your views regarding the following:

1.   What is (should be) the mean number of words non primitive word
 definitions?
2.   What is (should be) the mean number of machine instructions in a primitive
 word?
3.   Are your numbers based on guesses, personnal belief, or actual measured
 data?

I will summarize the results to the list.

Thanks.
                        Pedro.
==========================================================================
Pedro Luis Prospero Sanchez      internet: pl@vme131.lsi.usp.ansp.br
University of Sao Paulo          uunet:    uunet!vme131!pl
Dept. of Electrical Engineering  hepnet:   psanchez@uspif1.hepnet
phone: (055)(11)211-4574  home: (055)(11)215-6492 fax: (055)(11)815-4272
==========================================================================