First page Back Continue Last page Overview Graphics
Preliminary Results
Compiler speed is not a problem
The normal form transformations perfectly recognize even word-level identities identities
int a,b; a=a-b; a=a+b;
generates no code!
Complexity of XOR-based math is awkward for more than about 12-bit precision
int:12 a,b; a=a*b;
generates 156,392 ITEs!
How many temporary registers do we need?