Advertisement

Acta Informatica

, Volume 3, Issue 2, pp 155–170 | Cite as

Weakly context-sensitive languages as model for programming languages

  • P. F. Schuler
Article

Summary

An abstract family of formal languages containing context-free languages and properly contained in (deterministic) context-sensitive languages is introduced. This family is comprehensive enough to contain e.g. Algol 60 without admitting too complex recursive constructions possible in the frame of general context-sensitive languages.

This family is essentially a family of property-languages, whereby the considered properties are restricted to properties which are constructively definable from a finite number of context-free sets.

Keywords

Information System Operating System Data Structure Communication Network Information Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chomsky, N.: On certain formal properties of grammars. Information and Control 2, 137–167 (1959)Google Scholar
  2. 2.
    Smullyan, R. M.: Theory of formal systems. Annals of Mathematics Studies 47. Princeton (N.J.): Princeton University Press 1961Google Scholar
  3. 3.
    Naur, P. (ed.): Revised Report on the Algorithmic Language Algol 60. Numerische Mathematik 4, 420–453 (1963)Google Scholar
  4. 4.
    Kuroda, S. Y.: Classes of languages and linear bounded automata. Information and Control 7, 207–223 (1964)Google Scholar
  5. 5.
    Lewis, P. M., Stearns, R. E., Hartmanis, J.: Memory bounds for recognition of context-free and context-sensitive languages. IEEE Conference Record on Switching Circuit Theory and Logical Design, Anne Arbor (Mich.), 1965, pp. 191–202Google Scholar
  6. 6.
    Ginsburg, S.: Mathematical theory of context-free languages. New York: McGraw-Hill 1966Google Scholar
  7. 7.
    Early, J.: An efficient context-free parsing algorithm. COMM.ACM 13, 94–102 (1970)Google Scholar

Copyright information

© Springer-Verlag 1974

Authors and Affiliations

  • P. F. Schuler
    • 1
  1. 1.Universität des Saarlandes Fachbereich Angewandte Mathematik und InformatikSaarbrücken Bau 27Bundesrepublik Deutschland

Personalised recommendations