Languages of multiple abstaction

"fermineutron" <free4trample@yahoo.com>
29 Oct 2006 09:26:10 -0500

          From comp.compilers

Related articles
Languages of multiple abstaction free4trample@yahoo.com (fermineutron) (2006-10-29)
Re: Languages of multiple abstaction Juergen.Kahrs@vr-web.de (=?ISO-8859-1?Q?J=FCrgen_Kahrs?=) (2006-11-01)
Re: Languages of multiple abstaction gene.ressler@gmail.com (Gene) (2006-11-01)
Re: Languages of multiple abstaction gah@ugcs.caltech.edu (glen herrmannsfeldt) (2006-11-01)
Re: Languages of multiple abstaction esmond.pitt@bigpond.com (EJP) (2006-11-01)
Re: Languages of multiple abstaction DrDiettrich1@aol.com (Hans-Peter Diettrich) (2006-11-01)
Re: Languages of multiple abstaction torbenm@app-0.diku.dk (2006-11-01)
[7 later articles]
| List of all articles for this month |

From: "fermineutron" <free4trample@yahoo.com>
Newsgroups: comp.compilers
Date: 29 Oct 2006 09:26:10 -0500
Organization: Compilers Central
Keywords: design, performance

It is generally the belief that high level languages are slower than
the low level languages. It seems to me that there are 2 possible
reasons for it.


1) The abstraction level of HLL is higher, hence the compiler, using
todays technologies, can not create as clean code as it would from a
language of lower level of abstraction.


2) HLL allow the coding process to be easier, hence more inexperienced
programmers code in HLL than in LLL, this naturally results in the
poorly optimized code.


So the question becomes:
If a code is written in HLL and great care is taken to write the code
in such a way that the compiler will do as good of a job as it possibly
can, and then another code with the same care is written in LLL, will
the code originally written in HLL be that much slower?


Naturally the abstraction introduced by syntax of HLL will result in a
speed penalty, but it seems that it should not be as much as is the
stereotype of speed comparisons of HLL and LLL.


Naturally it is assumed that the code generated from HLL is NOT
performing any additional tasks then the code generated from LLL at
runtime, such as array boundary checking etc or array growing, while
in LLL arrays are 100% preallocated.


I am curious about the fraction of the speed penalty of HLL which in
no way can be reduced by more inteligent programing or certain
compiler swiches.


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.