Implementing a stack

@article{Baecker1962ImplementingAS,
  title={Implementing a stack},
  author={H. D. Baecker},
  journal={Commun. ACM},
  year={1962},
  volume={5},
  pages={505-507}
}
The task of implementing ALGOL has brought about farreaching developments in techniques of compilation and interpretation. The most powerful and widely-applicable of these appears to be the "s tack" of E. W. Dijkstra [1]. The stack is a means of allowing an arbi t rary degree of recursiveness in all subroutine calls, avoiding conflicts of space for return… CONTINUE READING