STG case compilation

I’m trying to make my way through Implementing Lazy Functional Languages on Stock Hardware: The Spineless Tagless G-machine. I’m stuck at compilation of case expressions. Suppose I need to generate native code for such STG expression: case <x> of Cons y ys -> <z> Simply speaking I would need to Push continuation on the stack. Evaluate subexpression x. It will eventually jump to the continuation. In the continuation save local environment (y and ys) Evaluate subexpression z. What I can’t fi...