Jean E. Sammet
Page 430
Pages 431-432
Published comparisons of the external fragmentation produced by first-fit and best-fit memory allocation have not been consistent. Through simulation, a series of experiments were performed in order to obtain better data on the …
John E. Shore
Pages 433-440
Methods of describing the syntax of programming languages in ways that are more flexible and natural than conventional BNF descriptions are considered. These methods involve the use of ambiguous context-free grammars together …
A. V. Aho, S. C. Johnson, J. D. Ullman
Pages 441-452
So-called “guarded commands” are introduced as a building block for alternative and repetitive constructs that allow nondeterministic program components for which at least the activity evoked, but possibly even the final state …
Edsger W. Dijkstra
Pages 453-457
Although not published as a numbered algorithm, Hanson's article “Stably Updating Mean and Standard Deviation of Data” in the January, 1975, issue of
Communications, [1] describes an algorithm for sequentially recomputing the …
Ira W. Cotton
Page 458
Interactive programming systems often contain help commands to give the programmer on-line instruction regarding the use of the various systems commands. It is argued that it would be relatively easy to make these help commands …
Stuart C. Shapiro, Stanley C. Kwasny
Pages 459-462
Tien Chi Chen and Irving T. Ho in their paper “Storage-Efficient Representation of Decimal Data” [1] present a scheme for the compression of numbers stored in binary coded decimal (BCD) form. Their compression scheme involves …
Alan Jay Smith
Page 463
This paper studies the properties of a new class of file organizations (CRWR) where records relevant to every query are stored in consecutive storage locations but the organizations contain redundancy. Some theorems which provide …
Sakti P. Ghosh
Pages 464-471
A method is described which allows parallel processing of packed data items using only ordinary full-word computer instructions, even though the processing requires operations whose execution is contingent upon the value of a …
Leslie Lamport
Pages 471-475
The techniques for minimizing logic circuits are applied to the simplification of decision tables by the combining of decision rules. This method is logically equivalent to the Quine-McCluskey method for finding prime implicants …
Keith Shwayder
Pages 476-480
