In this chapter, first, the general concepts regarding machine languages will be presented. Then, a very simple machine language will be presented. Of course, this will be quite unrealistic to use as no real hardware exists to run it. It will simply be used to demonstrate how to process it.
Then, a very simple algorithm will be written in the machine language—a formatter of integer numbers. A Rust program to interpret this program will be written without using an external library (word_machine_convert).
Then, a more complex program will be written in this machine language—the famous algorithms invented by Eratosthenes to find prime numbers (named the sieve of Eratosthenes). The previous Rust program will be used to interpret this machine language program (word_machine_sieve).
Afterward, a somewhat more realistic machine language will be defined that is capable of addressing single bytes instead of words. The issues raised by this machine language will be...
