SYMBOLIC ADDRESS-SYMBOLIC OPTIMUM PROGRAMS FOR A DRUM-MEMORY COMPUTER

摘要

Because of the man-hours involved, lengthy computer programs are rarely time-optimized. It is found that the optimizing process for a computer with magnetic drum memory is itself a computable process. A program for the Royal McBee LGP-30 has been developed which performs the optimizing process on a data program written in a simple symbolic language (memory locations symbolized rather than specified). Although the data program is lengthened 2 to 5 times, it is 1/4 to 1/3 faster. Because of the length and lack of sequence in the resultant program, it is felt that an additional program is necessary to translate the sym¬bolic language directly to unoptimized computer language (memory locations specified), for ease in troubleshooting. Such a program has also been developed. Examples of the symbolic language are given as well as the results of proc-essing by the two programs.