Home → Magazine Archive → July 1965 (Vol. 8, No. 7) → The structure of yet another ALGOL compiler → Abstract

The structure of yet another ALGOL compiler

By H. Kanner, P. Kosinski, C. L. Robinson

Communications of the ACM, Vol. 8 No. 7, Pages 427-438

A high-speed “top down” method of syntax analysis which completely eliminates “back-up” of the source string has been implemented in a convenient macro-language. A technique of simulation at compile time of the use of a conventional run-time stack enables the generation of code for expressions which minimizes stores, fetches and stack-pointer motion at run time, while properly treating recursion and side effects of procedures. Block structure and recursion are handled without need for interpretive methods at run time. The “context problem” in the transmission to recursive procedures of parameters “called by name” is solved in a manner which permits the handling of the common cases of simple expressions and array identifiers with particular efficiency.

The full text of this article is premium content


No entries found