skip to main content
article
Free Access

“Structural connections” in formal languages

Published:01 February 1964Publication History
Skip Abstract Section

Abstract

This paper defines the concept of “structural connection” in a mechanical language in an attempt to classify various formal languages according to the complexity of parsing structures on strings in the languages. Languages discussed vary in complexity from those with essentially no structure at all to languages which are self-defining. The relationship between some existing recognition techniques for several language classes is examined, as well as implications of language structure on the complexity of automatic recognizers.

References

  1. 1 CHOMSKY, N. On certain formal properties of grammars. Informat. Contr. 2, 137,167.Google ScholarGoogle Scholar
  2. 2 ----. A note on phrase structure grammars. Informat. Contr. 2, 393-395.Google ScholarGoogle Scholar
  3. 3 PAUL, M. A General Processor for Certain Formal Languages. Gymbalie Languages in Data Processing, Gordon and Breach, London 1962, pp. 65-74.Google ScholarGoogle Scholar
  4. 4 EICKEL, J., PAUL, M., BAUER, F. L., SAMUELSON, K. "A Syntax Controlled Generator of Formal Language Processors." Inst. fur Ant. Math. Univ. Mainz. (September, 1962).Google ScholarGoogle Scholar
  5. 5 BACKU8, J. W. The syntax and semantics of the proposed international algebraic language of the Zurich ACM-GAMM Conference. Proc. Internat. Conference on Information Processing, UNESCO, June, 1959, pp. 125-132.Google ScholarGoogle Scholar
  6. 6 NAUR, PETER (Ed.) Report on the algorithmic language ALGOL 60. Comm. ACM 3 (1960), 299-314. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7 IRONS, E. T. A syntax-directed compiler for ALGOL 60. Comm. ACM 4 (1961), 51-55. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. “Structural connections” in formal languages

                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 7, Issue 2
                  Feb. 1964
                  92 pages
                  ISSN:0001-0782
                  EISSN:1557-7317
                  DOI:10.1145/363921
                  Issue’s Table of Contents

                  Copyright © 1964 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 1964

                  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