LIST PROCESSING RESEARCH TECHNIQUES.

Reports an investigation on the formal characteristics and feasibility of the potential and utilization of the last-in-first-out and, the first-in-first-out list memories. This report covers one years effort and also includes progress in the fourth quarter. Progress has been made in the following areas 1 Development of software techniques - Additional instructions have been incorporated in the SPRINT system and a program has been written in SPRINT which compiles and executes a FORTRAN-like language, the speed of the Growing Machine has been increased by hash-addressing of the name table, provision for free-form input has been made, and a new Growing Machine, called GAIN, of greater speed and flexibility has been completed which draws heavily on the ideas previously developed in GROMAC and SPRINT. 2 Study of unconventional processor organization and other uses of list memories - Hardware realization of the Growing Machine and use of first-in-first-out list memories as addressable memories have been studied. 3 Determination of processing applications areas and simulation studies - Several minor programs have been written to illustrate various programming techniques making considerable use of the main features of SPRINT including accumulation and analysis of control and storage list usage. A final application of list processing techniques to the induction of grammar so that a growing system may learn to recognize FORTRAN is underway. Author