The ultimate programming language
Assembly is perfect.
In assembly code = data. In fact that is the basis of the turing machine.
It is convenient for programmers to omit history.
The defect rate in an x86 processor is 0. How many bugs are there in your compiler ?
x86 is backwards compatible.
Each instruction is executed in fixed time
You can’t write boot code in your favorite $lang
GOTO directly maps to a state transitions, branch/dispatch/control tables
This is a powerful programming technique.
GOTO’s are easier to follow than recursion. Even novices understand GOTO’s. Besides
recursion always needs an additional state variable, which is slow.
Self-rewriting code is epic on all accounts and it beats Lisp’s macros.
Turing machine is made up of GOTOS and branches and yet modern languages restrict it.
How to imitate an unrestricted GOTO ?
- Mutual Recursion
- Tail Calls
- Fake an instruction set with an array.