Gene F. Rose
Pages 52-61
Certain phase structure grammars define languages in which the phrasehood and structure of a substring of a sentence may be determined by consideration of only a bounded context of the substring. It is possible to determine,bounded …
Robert W. Floyd
Pages 62-67
B. M. Leavenworth
Pages 72-80
Kenneth E. Iverson
Pages 80-88
One of the most primitive parts of a formula language is its specification of input-output actions within the framework of the language. While the specification is intrinsically more complex, say, than the evaluation of an arithmetic …
A. J. Perlis
Pages 89-97
T. B. Steel
Pages 97-103
The structure of a digital computer programming language which covers a wide class of business and file processing applications is presented. Such a structure, based on identifying and incorporating into a compiler the aspects …
Lionello A. Lombardi
Pages 104-111
The problem of compiling efficient 6600 codes prompted the development of an intermediate language reflecting the structure of the machine, that is more easily manipulated in improving object program efficiency. The subject of …
R. W. Allard, K. A. Wolf, R. A. Zemlin
Pages 112-119
An interpretive programming package is described for computation with operands which may be real, complex, single or double precision, or real multiple precision. It also performs operations on matrices formed from these elements …
R. A. Brooker
Pages 119-127
A. J. Perlis, Renato Iturriaga
Pages 127-130
This note is by way of commentary on the notions of “bounded context” of Floyd [1] and “structural connections” of Irons [2], as these notions relate to as yet unpublished researches growing out of the development of the author's …
Douglas T. Ross
Pages 131-133
The topics began with discussion of almost exclusively syntactic analysis and methods. Beginning with context-free phrase-structure languages, we considered limitations thereof to remove generative syntactic ambiguities (Floyd) …
S. Gorn
Pages 133-136
This paper defines the concept of “structural connection” in a mechanical language in an attempt to classify various formal languages according to the complexity of parsing structures on strings in the languages. Languages discussed …
E. T. Irons
Pages 67-72
