Scheme Compiler in Incremental Steps: Binary Primitives

This page cannot be shown here. You can still read it on the original site — the toolbar below keeps your place in the directory.

In the previous post, we added unary primitives like add1 and null? to our language. In this post, let’s implement binary primitives like +, *, and char<?. We cannot, in general, use a single register because evaluating one argument may overwri...

Read on //scheme-compiler-4-binary-primitives.html ↗