Skip to main content
SpringerLink
Log in

Description of data structures in programming languages

  • Published:
Journal of Soviet Mathematics Aims and scope Submit manuscript

Abstract

We propose an approach to the description of the semantics of data structures in programming languages, based on the notion of network grammars which allow for complex dependencies between various data elements. The proposed method can be efficiently applied for the description of data structures in various data description languages or for the definition of the semantics of data manipulation languages.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Literature cited

  1. A. Aho and J. Ullman, The Theory of Parsing, Translation, and Compiling [Russian translation], Moscow (1978).

  2. The CODASYL Data Description Language [Russian translation], Moscow (1981).

  3. V. A. Tuzov, A Mathematical Model of the Language [in Russian], Leningrad (1984).

Download references

Authors
  1. S. V. Mshagskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 159, pp. 153–155, 1987.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mshagskii, S.V. Description of data structures in programming languages. J Math Sci 47, 2933–2935 (1989). https://doi.org/10.1007/BF01305225

Download citation

  • Issue Date:

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

Keywords

Search

Navigation