|Code size as a function of source size email@example.com (=?ISO-8859-1?Q?J=FCrgen_B=F6hm?=) (2008-03-12)|
|Re: Code size as a function of source size firstname.lastname@example.org (Marco van de Voort) (2008-03-14)|
|Re: Code size as a function of source size email@example.com (Barry Kelly) (2008-03-14)|
|Re: Code size as a function of source size SidTouati@inria.fr (Sid Touati) (2008-04-22)|
|Date:||Wed, 12 Mar 2008 20:28:20 +0100|
|Posted-Date:||13 Mar 2008 17:54:52 EDT|
I would like to pose a very simple question, for which nevertheless I
could not find an answer through google:
Of what general type is the dependence of the size of compiled code
to the size of the respective source code?
Or to put it "mathematically", what function f(s) approximates the
points (s, o(s)) best, where s is the size of the source code (say in
bytes and normalized by removing commentaries and not using uncommonly
long identifiers or amounts of white space) and o(s) is the size of
the corresponding object code (without any libraries linked in). It
seems natural to assume a linear dependence, but maybe the point-cloud
(s,o(s)) introduced above falls into several sub-clouds, each having
its own characteristic function?
The reason I am asking is, that I wrote a little Lisp compiler for a
CPU that I developed and doing some comparisons as indicated above, it
seemed to be a linear relationship with o(s) approx. 1.75 * s.
Now I would of course like to do some comparisons with other
compilers (not necessary only Lisp compilers) for other architectures,
but I could not find any figures tabulated on the net. Does anyone have
Thanks in advance for all answers
J|rgen Bvhm www.aviduratas.de
Return to the
Search the comp.compilers archives again.