But Scheme languages are particularly simple in terms of their syntax and logic to the point that it is often said people write more scheme compilers than schem

But Scheme languages are particularly simple in terms of their syntax and logic to the point that it is often said people write more scheme compilers than scheme libraries. I thought it would be possible to deterministically translate R^(n-1)RS to R^(n)RS