Algorithms for Analysis and Translation of a Special Set of Computable Mathematical Forms

摘要

The coding algorithms for the analysis and translation of the sequential paper tape code produced in typing a program, that are referenced in Klerer, M. and May, J., An experiment in a user oriented computer system, Comm. ACM 7, 5 (May 1964), 290-294, are given. Originally, this was an appendix to the above paper but, for reasons of space, it was decided to issue the appendix as a separate document. The correspondence between the two-dimensional typewritten document and the one-dimensional paper tape code string is unique only in the sense that reading the paper tape code will regenerate the document exactly as originally typed, errors and overtyping included. The translating algorithm reads the particular tape and assigns a unique storage location in memory which in fact has a one-to-one correspondence to the strokes of the actual two-dimensional typewritten document. Thus, all overtyping strokes actually enter the same memory cell, and erasures are distinguished from reasonable overtypes (e.g.,A) by flag bits.