Skip to main content

Van wijngaarden grammars as a special information processing model

  • Communications
  • Conference paper
  • First Online:
Book cover Mathematical Foundations of Computer Science 1980 (MFCS 1980)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 88))

Abstract

Van Wijngaarden grammars can be used for directly constructing problem solutions according to A. van Wijngaarden's nonprocedural problem solving method. The basis for this is the computational power of the grammars as well as their suitability for expressing abstractions and general transformations. A formal analysis of the latter property leads to an approach towards a general information processing model. As an application of this model a state-oriented method of program development is presented.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bauer, F.L.: Algorithms and Algebra, Symposium “Algorithm in Modern Mathematics and Computer Science”, Urgench, USSR, September 1979

    Google Scholar 

  2. Cleaveland, J.C., and Uzgalis, R.C.: Grammars for Programming Languages, New York etc., 1977

    Google Scholar 

  3. Deussen, P.: A Decidability Criterion for van Wijngaarden Grammars, Acta Informatica, 5, 353–375, 1975

    Google Scholar 

  4. Dijkstra, E.W.: Guarded Commands, Nondeterminacy and Formal Derivation of Programs, Comm.ACM, 18, 453–457, 1975

    Google Scholar 

  5. Hesse, W.: Vollständige formale Beschreibung von Programmiersprachen mit zweischichtigen Grammatiken, Bericht 7623, TUM, München, 1976

    Google Scholar 

  6. Mal'cev, A.I.: Algorithms and recursive functions, (translated from Russian), Groningen, 1970

    Google Scholar 

  7. Scott, D.: Logic and Programming Languages, Comm.ACM, 19, 634–641, 1976

    Google Scholar 

  8. van Wijngaarden, A.: vW — Grammatiken und konzeptuelle Komplexität, Kolloquium “Rechenanlagen und Anwendungsverfahren”, Inst. f. Angew. Math. u. Rechenzentrum d. Univ. Hamburg, Juni 1979 (not published)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

P. Dembiński

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kupka, I. (1980). Van wijngaarden grammars as a special information processing model. In: Dembiński, P. (eds) Mathematical Foundations of Computer Science 1980. MFCS 1980. Lecture Notes in Computer Science, vol 88. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022519

Download citation

  • DOI: https://doi.org/10.1007/BFb0022519

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10027-0

  • Online ISBN: 978-3-540-38194-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics