skip to main content
article
Free Access

A theory of discrete patterns and their implementation in SNOBOL4

Published:01 February 1973Publication History
Skip Abstract Section

Abstract

The notion of a discrete pattern is formalized and certain properties deduced. A pattern is shown to be a generalization of a formal language. Algorithms for implementing the kinds of patterns in SNOBOL4 are given. The general approach is to create, in-so-far as possible, a bottom-up parse from a top-down specification.

References

  1. 1 Chomsky, N. Three models for the description of language. PGIT 2 (Mar. 1956), 113-124.Google ScholarGoogle Scholar
  2. 2 Christensen, C. AMBIT/2 (programming language). Applied Data Research, Wakefield, Mass., 1970.Google ScholarGoogle Scholar
  3. 3 Dewar, R.B. SPITBOL-version 2.0. SNOBOL4 Document s4D23, Illinois Inst. of Tech., Chicago, 1971.Google ScholarGoogle Scholar
  4. 4 Feldman, J., and Gries, D. Translator writing systems. Comm. ACM 11, 2 (Feb. 1968), 77-113. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5 Floyd, R.W. The syntax of programming languages. IEEE Trans. EC-13 (Aug. 1964), 346-353.Google ScholarGoogle Scholar
  6. 6 Gimpel, J.F. Blocks-a new datatype for SNOBOL4. Comm. ACM 15, 6 (June 1972), 438-447. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7 Gimpel, J.F. The theory and implementation of pattern matching in SNOBOL4 and other programming languages. SNOBOL4 doc. S4D24, Bell Telephone Laboratories, Holmdel, N.J., 1971.Google ScholarGoogle Scholar
  8. 8 Gries, D. Compiler Construction. For Digital Computers. Wiley, New York, 1971. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9 Griswold, R.E., and Polonsky, I.P. String pattern matching in the programming language SNOBOL. Internal Memo., Bell Telephone Laboratories, Holmdel, N.J., 1964.Google ScholarGoogle Scholar
  10. 10 Griswold, R.E., Poage, J.F., and Polonsky, I.P. The SNOBOL4 Programming Language. Prentice-Hall, Englewood Cliffs, N.J., 1968. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11 Harrison, M.C. Data-Structures and Programming. Courant Institute of Math. Sciences, New York, 1970, p. 289.Google ScholarGoogle Scholar
  12. 12 Hoperoft, J., and Ullman, J. Formal Languages and Their Relation to Automata. Addison-Wesley, Reading, Mass., 1969. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13 McClure, R.M. TMG-A syntax directed compiler. Proc. ACM, 20th Nat. Conf., 1965, pp. 252-274.Google ScholarGoogle Scholar
  14. 14 Thompson, K. Regular expression search algorithm. Comm. ACM 11, 6 (June 1968), 419-422. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. 15 Thompson, K. QED-A text editor. (To be published.) Internal Memo., Bell Telephone Laboratories, Murray Hill, N.J.Google ScholarGoogle Scholar
  16. 16 Yngve, V.H. A programming language for mechanical translation. Mech. Trans. 4 (Dec. 1957), 59-65.Google ScholarGoogle Scholar

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in

Full Access

  • Published in

    cover image Communications of the ACM
    Communications of the ACM  Volume 16, Issue 2
    Feb. 1973
    58 pages
    ISSN:0001-0782
    EISSN:1557-7317
    DOI:10.1145/361952
    Issue’s Table of Contents

    Copyright © 1973 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 1 February 1973

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • article

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader