Several of the computer languages that are oriented toward problems in symbol manipulation use a list type of memory organization.1 The advantages of such a memory organization have been discussed elsewhere and will not be repeated here. The purpose of this note is to describe the method used in realizing a list language on the Philco 2000. Information Processing Language V (IPL-V) was chosen as the source language for the list processor for the 2000 because this language has been well documented and has been implemented on several computers.2 Heretofore, IPL-V has been implemented as an interpretive system. The interpretive system has three major components: (1) a loader which translates card images into internal machine words; (2) an interpreter which decodes instructions; and (3) a set of primitive processes, the “J's,” which make up the bulk of the instruction vocabulary. The implementation of such an interpretive system has been a rather lengthy procedure usually estimated as taking six man-months.
The Latest from CACM
Shape the Future of Computing
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get InvolvedCommunications of the ACM (CACM) is now a fully Open Access publication.
By opening CACM to the world, we hope to increase engagement among the broader computer science community and encourage non-members to discover the rich resources ACM has to offer.
Learn More
Join the Discussion (0)
Become a Member or Sign In to Post a Comment