August 1972 - Vol. 15 No. 8
Features
Generating parsers for affix grammars
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…
Political redistricting by computer
The problems of political redistricting are considered and a computer method for redistricting is presented. Criteria for acceptable redistricting are discussed,…
An extensible editor for a small machine with disk storage
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…
An environment for research in microprogramming and emulation
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…
A model of memory contention in a paging machine
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…
Compiling fixed-point multiplications
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,…
A bonus from van Wijngaarden’s device
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…
A note on the generation of rosary permutations
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…
Immediate predominators in a directed graph [H]
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…