Sun Sep 21 10:33:07 CEST 2014
Bottom up for M4F
Basically this means: represent the machine primitives and present a
bridge between those and the (fixed) rai primitives.
The interesting question here is machine mapping: replace the
So, it should be straightforward to support a M4F -> RAI prim mapping.
Is it also possible to implement the inverse in a deterministic way.
I.e. implement an instruction mapper that is guaranteed to recover
native instructions? If this is possible, it might be a better
Required knowledge: Muchnick's chapter on peeplhole optimizers.