Handle stack-too-deep errors

[alexcere]

We need to implement mechanisms for handling stack-too-deep errors. The following steps must be followed to implement our first approach:

• Modify greedy algorithm to assume the corresponding stack element is already stored in memory when it cannot be reached.
• First pass: determine when the element was accessible the last time in order to store it in memory
• Second pass: replace the memory accesses by the corresponding instructions