DID YOU KNOW? DTIC has over 3.5 million final reports on DoD funded research, development, test, and evaluation activities available to our registered users. Click
HERE to register or log in.
Accession Number:
AD0652724
Title:
LIST PROCESSING RESEARCH TECHNIQUES.
Descriptive Note:
Quarterly progress rept. no. 2, 15 Sep-14 Dec 66,
Corporate Author:
PENNSYLVANIA UNIV PHILADELPHIA MOORE SCHOOL OF ELECTRICAL ENGINEERING
Report Date:
1967-05-01
Pagination or Media Count:
153.0
Abstract:
The second report is of an investigation on the formal characteristics and feasibility of the potential and utilization of push-down type computer memories. Development of software techniques for symbol data manipulation under this study-period concerns the refinement of the SPRINT language. A SPRINT interpreter has been re-written for operation on the IBM 7040. Work has been continued on the Growing Machine whose development is considered to be a test-bed for list processing development. Additional work related to the Growing Machine concept includes an ALGOL recognizer, addition of new push-down operations to the Growing Machine simulator, an analysis of alternate push-down logics, and construction of more complicated mechanisms out of push-downs using the Growing Machine. A concept of an all push-down machine, in which at least all but a very few of the static registers become a push-down list, and where the main memory is a set of addressed or labeled push-downs, has begun to take shape. The solution to the problem of interconnection, cycling, and contents-interpretation of the push-down lists is to be provided in the two simulated systems under study. The usefulness of push-down memories in conventional andor unconventional processors is being examined through applications of push-down features in problem areas such as sorting, information retrieval, computation, and language translation. Other applications of list memories under study include push-down list memories as conventional address memories and as secondary storage devices. Linking of lists and using a 100K word associative memory using 1000 hardware FIFOs first-in, first-out are also discussed. Author
Distribution Statement:
APPROVED FOR PUBLIC RELEASE
