G. Ramalingam
Theoretical Computer Science
An algorithm for a macro processor which has been used as the base of an implementation, by bootstrapping, of processors for programming languages is described. This algorithm can be easily implemented on contemporary computing machines. Experience with programming languages whose implementation is based on this algorithm indicates that such a language can be transferred to a new machine in less than one man-week without using the old machine. © 1969, ACM. All rights reserved.
G. Ramalingam
Theoretical Computer Science
Thomas R. Puzak, A. Hartstein, et al.
CF 2007
Hendrik F. Hamann
InterPACK 2013
Michael D. Moffitt
ICCAD 2009