Skip to main content
SpringerLink
Log in

Aspects of compact programs and directly executed languages

  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

Some aspects of directly executed languages (DEL's) are described. Principles for the design of a DEL are given and in particular a survey of principles used to design a DEL yielding very compact programs. The idea of a refined display to get small address fields in DEL's for blockstructured languages is introduced. A comparison between IBM S/360 machine language and a specific DEL for the machine-oriented higher level language MARY gives quantitative results for the applicability of the techniques described.

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

References

  1. H. W. Lawson Jr and B. K. Smith,Functional characteristics of a multilingual processor, IEEE Trans. Comput., vol C-20, July 1971, pp. 732–742.

    Google Scholar 

  2. W. T. Wilner,Design of the Burroughs B1700, Proceedings of the FJCC, 1972.

  3. H. W. Lawson Jr and B. Malm,A flexible asynchronous microprocessor, BIT, Bind 13, hefte nr. 2, 1973.

  4. L. W. Hoevel,»Ideal« Directly Executed Languages: an analytical argument for emulation, IEEE Trans. Comput., vol. C-23, August 1974, pp. 759–767.

    Google Scholar 

  5. R. Conradi and P. Holager,Mary Textbook, RUNIT, Trondheim, 1974.

  6. A. van Wijngaarden (editor), B. J. Mailloux, J. E. L. Peck and C. H. A. Koster,Report on the Algorithmic Language ALGOL 68, Mathematisch Centrum, MR 101, Amsterdam, October 1969.

  7. N. Wirth,The Programming Language Pascal, Acta Informatica 1, 35–63 (1971).

    Google Scholar 

  8. P. J. Denning,The working set model for program behaviour, Comm. ACM 11, 5 (May 1968), 323–333.

    Google Scholar 

  9. D. A. Huffman,A method for the construction of minimum redundancy codes, Proceedings IRE 40, sept. 1952. pp. 1098–1101.

  10. W. T. Wilner,Burroughs B1700 memory utilization, Proceedings of the FJCC, 1972.

  11. P. Wegner,Programming languages, Information Structures and Machine Organization, McGraw Hill, New York, 1968.

    Google Scholar 

  12. O. S. Hirschberg,A class of dynamic memory allocation algorithms, Comm ACM 16, 10 (Oct. 1973), 615–618.

    Google Scholar 

  13. M. J. Flynn,Trends and problems in computer organizations, IFIP Congress, Stockholm, 1974.

Download references

Author information

Authors and Affiliations

  1. Institutionen För Informationsbehandling Chalmers Tekniska Högskola, Sweden

    Sven Tafvelin & Åke Wikström

  2. Göteborgs Universitet, S-40220, Göteborg 5, Sweden

    Sven Tafvelin & Åke Wikström

Authors
  1. Sven Tafvelin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Åke Wikström
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work has been supported by SAAB-SCANIA AB and The Swedish Board for Technical Development (72-1577/U 1220, 74-4723).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tafvelin, S., Wikström, Å. Aspects of compact programs and directly executed languages. BIT 15, 203–214 (1975). https://doi.org/10.1007/BF01932694

Download citation

  • Received:

  • Issue Date:

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

Key words

CR Categories

Search

Navigation