Robert J. McKenzie
ABSTRACT
A facility capable of describing the basic processing of strings of symbols is introduced. Based upon the primative characteristics of string processing, the proposal is capable of being readily incorporated into a majority of general purpose procedural programming languages currently available. Also, the proposed techniques can be used to define the more sophisticated operations usually associated with specialized string processing languages.
- 1.D. J. Farber, R. E. Griswold and I. P. Polonsky, SNOBOL, A String Manipulation Language, Journal ACM, Vol. 12, 1964, pp. 21-30. Google Scholar
Digital Library
- 2.D. J. Farber, R. E. Griswold and I. P. Polonsky, The SNOBOL 3 Programming Language, Bell Systems Technical Journal Vol. 45, 1966, pp. 943 - 985.Google Scholar
- 3.R. E. Griswold, J. F. Poage and I. P. Polonsky, The SNOBOL 4 Programming Language, Prentice-Hall, Englewood Cliffs, N.J., 1973. Google ScholarDigital Library
- 4.W. M. McKeeman, J. J. Horning, D. B. Wortman, The Compiler Generator, Prentice-Hall, Englewood Cliffs, N.J., 1970.Google Scholar
- On the abstract processing of strings
Recommendations
The Coolest Way to Generate Binary Strings
Pick a binary string of length n and remove its first bit b . Now insert b after the first remaining 10, or insert $\overline{b}$ at the end if there is no remaining 10. Do it again. And again. Keep going! Eventually, you will cycle through all 2 n of the ...
Prefix and Suffix Reversals on Strings
SPIRE 2015: Proceedings of the 22nd International Symposium on String Processing and Information Retrieval - Volume 9309The Sorting by Prefix Reversals problem consists in sorting the elements of a given permutation $$\pi $$ with a minimum number of prefix reversals, i.e. reversals that always imply the leftmost element of $$\pi $$. A natural extension of this problem is ...
Bounding prefix transposition distance for strings and permutations
A transposition is an operation that exchanges two adjacent substrings. Transpositions over permutations, the sequences with no repeated symbols, are related to genome rearrangements. If one of the substrings is restricted to a prefix then it is called ...
Comments