🚀 go-pugleaf

John Hascall recently posted the following tool

/PROC {
%
%  /NAME { #locals begin .... end }  PROC  -
%
        dup        % /NAME {#...} {#...}
        dup        % /NAME {#...} {#...} {#...}
        0 get      % /NAME {#...} {#...} #locals
        0 exch     % /NAME {#...} {#...} 0 #locals
        dict       % /NAME {#...} {#...} 0 <dictionary with room for #locals>
        put        % /NAME {D...}
        bind       % /NAME {D...}
        def        %
} bind def

Although it is a good tool for most applications, the problem
I see is that the resulting procedure is non-reentrant.
The procedure can not be recursive. The local variables are not
allocated on a stack.  The space for the local variables is allocated
statically at procedure definition time.

This difference is alot like the difference between Fortran and
other languages like Algol, Pascal or C.

Dale Moore