Board.KolibriOS.org
http://board.kolibrios.org/

Why assembly programs are faster than HLL programs, despite that the compilers are so advanced? Jevons paradox in progra
http://board.kolibrios.org/viewtopic.php?f=2&t=3818
Page 1 of 1

Author:  ProMiNick [ Fri Jan 04, 2019 3:10 pm ]
Post subject:  Re: Why assembly programs are faster than HLL programs, despite that the compilers are so advanced? Jevons paradox in pr

HLLs designed to solve in realtime things that are cleaner for programmer in designtime. Because of such solving penalty - execution is slower. In final release of HLL products still present rudiments for debugging( and in some java-like HLLs present rudiments for code timings).

And itnithand, I would wish to escape to any HLL from assembly with only one condition: all data should be untyped by default with posibility to be typed, language should be completely opensourced - no linkers, no object files, no compiler directives without source code acessible for manual editing, no macros without sources acessible for manual editing, no meta programming shit - everithing that goes to output file should be controlled by me (I don`t meanyng control for every byte, but I have to be able to replace EVERY sequence of bytes by another sequence, and range of such sequences for replacement should be as wide as possible).
But for now only 2 assemblers matches this condition: FASM & FASMG

Author:  lev [ Wed Jan 09, 2019 7:54 pm ]
Post subject:  Re: Why assembly programs are faster than HLL programs, despite that the compilers are so advanced? Jevons paradox in pr

The post of itnithand is a quote from reddit (https://www.reddit.com/r/programming/co ... _than_hll/), it's only purpose is to promote three links at the bottom of his post. It's a spam.

Page 1 of 1 All times are UTC+03:00
Powered by phpBB® Forum Software © phpBB Limited
https://www.phpbb.com/