Anthony Ralston
Page 715
John G. Herriot
Pages 719-720
Donald E. Knuth
Pages 721-726
Affix grammars are two-level grammars which are similar to van Wijngaarden's two-level grammars used in the definition of Algol 68. Affix grammars are shown by Koster to be equal in power to van Wijngaarden grammars. They are …
David Crowe
Pages 728-734
The problems of political redistricting are considered and a computer method for redistricting is presented. Criteria for acceptable redistricting are discussed, including population equality, compactness, contiguity, and preservation …
Robert E. Helbig, Patrick K. Orr, Robert R. Roediger
Pages 735-741
A design philosophy for developing a sophisticated utility program is illustrated by the actual design and implementation of a text editor. A versatile data structure is employed so that only a small number of programmed subroutines …
Arthur J. Benjamin
Pages 742-747
The development of the research project in microprogramming and emulation at State University of New York at Buffalo consisted of three phases: the evaluation of various possible machines to support this research; the decision …
Robert F. Rosin, Gideon Frieder, Richard H. Eckhouse
Pages 748-760
This paper is concerned with certain aspects of contention for main memory resources in a multiprogrammed computer system operating under demand paging. In the model presented, the number of page-frames of main memory allocated …
P. H. Oden, G. S. Shedler
Pages 761-771
With reference to the article by H. T. Gladwin [1], (Comm.) it should be noted that the technique described is a limited subset of techniques known for many years, particularly to programmers for machines lacking an integer multiply …
Herbert J. Bernstein
Page 772
W. L. van der Poel
Page 772
In [1] van Wijngaarden presented a rather remarkable technique for rewriting ALGOL 60 programs to eliminate all labels. The purpose of this note is to point out that the rewriting would also eliminate the use of array returning …
James H. Morris
Page 773
Peter R. Jones
Page 774
Harada [1] has given a method of generating rosary permutations, and of associating an integer with each such permutation in a one-to-one manner. In this note we show that both these ends can be achieved more easily than by Harada's …
Ronald C. Read
Page 775
W. Squire
Pages 776-777
We assume a directed graph whose nodes are labeled by integers between 1 and
n. The arcs of this graph correspond to the flow of control between blocks of a computer program. The initial node of this graph (corresponding to the …
Paul W. Purdom, Edward F. Moore
Pages 777-778
