Symbol manipulation in FORTRAN: SASP I subroutines

Authors:
M. J. Bailey;M. P. Barnett;P. B. Burleson
Affiliations:
Massachusetts Institute of Technology, Cambridge, Mass.;Massachusetts Institute of Technology, Cambridge, Mass. and University of London Computer Unit, 44, Gordon Square, London W.C.1, England;Massachusetts Institute of Technology, Cambridge, Mass. and Cornell University, Ithaca, N. Y.
Venue:
Communications of the ACM
Year:
1964

Citing 3
Cited 4

Comments on “a continued operation notation”

Communications of the ACM
A list-type storage technique for alphanumeric information

Communications of the ACM
Syntactic analysis by digital computer

Communications of the ACM

Dynamic memory allocation in computer simulation

Communications of the ACM
A note on storage of strings

Communications of the ACM
SYMPLE: a general syntax directed macro preprocessor

AFIPS '69 (Fall) Proceedings of the November 18-20, 1969, fall joint computer conference
Analysis of free-storage algorithms: revisited

IBM Systems Journal

Quantified Score

Hi-index	48.25

Visualization

Abstract

A set of subroutines for use in FORTRAN are described whose purpose is to synthesize output strings from (i) input strings which have been analysed by the SHADOW general syntactic analysis subroutine reported earlier, and/or (ii) packed BCD strings formed in any way. Function-type subroutines are included for intermediate manipulations, which are performed on the strings which are stored in an abbreviated internal representation. The automatic way in which an internal representation for each newly created substring is stored sequentially in a block of common storage, and the manner in which a storage block is dynamically allocated for that purpose, are discussed.