Skip to main content
Springer Nature Link
Log in

A universal compiler system based on production rules

  • Published:
Save article
View saved research
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

This paper describes a compiler system which makes use of production rules for the translation. The source language syntax is defined in terms of a phrase structure grammar. Semantic rules are provided by an extension of the production rules, and special symbols are introduced for this purpose. Recognition of symbol strings is facilitated by a special syntactic filter routine. An example of a simple macro compiler is given to illustrate the basic concepts of the system.

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

Access this article

Log in via an institution

Subscribe and save

Springer+
from $39.99 /Month
  • Starting from 10 chapters or articles per month
  • Access and download chapters and articles from more than 300k books and 2,500 journals
  • Cancel anytime
View plans

Buy Now

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

Explore related subjects

Discover the latest articles, books and news in related subjects, suggested using machine learning.

References

  1. Brooker, R. A. and Morris, D.,A general translation program for phrase-structure languages, Jour. ACM, 1962, vol. 9, No. 1.

  2. Chomsky, N.,On certain formal properties of grammars, Information and Control, 1959, vol. 2, No. 2.

  3. Eickel, J. and Paul, M.,The parsing and ambiguity problem for Chomsky languages, Formal Language Description Languages (Ed. by T. B. Steel), North-Holland Publishing Company, Amsterdam, 1966, pp. 52–75.

    Google Scholar 

  4. Ginsburg, S. and Greibach, S.,Deterministic context-free languages, Information and Control, 1966, vol. 9, No. 6.

  5. Ingerman, P. Z.,A syntax-oriented translator, Academic Press, New York and London 1966.

    Google Scholar 

  6. Irons, E. T.,A syntax-directed compiler for ALGOL 60, Comm. ACM, 1961, vol. 4, No. 1.

  7. Kleene, S. C.,Introduction to metamathematics, Princeton, N. J., van Nostrand, 1952.

  8. Wilkes, M. V.,An experiment with a self-compiling compiler for a simple list-processing language, Annual Review in Automatic Programming, Vol. 4, 1964, Pergamon Press, New York.

    Google Scholar 

  9. Zhogolev, E. A.,Algorithm for the recognition of categories using syntactic tables, (Russian), Journal of computing mathematics and mathematical physics, Moscow, 1965, vol. 5, No. 4.

  10. Dömölki, B.,Algorithms for the recognition of properties of symbol strings, (Russian), Journal of computing mathematics and mathematical physics, Moscow 1965, vol. 5, No. 1.

  11. Dömölki, B.,Problems of the syntactic analysis of formal languages, (Russian), Computational Linguistics, Budapest No. 5, 1967.

Download references

Author information

Authors and Affiliations

  1. Laboratory for Information Processing, Budapest, Hungary

    Bálint Dömölki

Authors
  1. Bálint Dömölki
    View author publications

    Search author on:PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dömölki, B. A universal compiler system based on production rules. BIT 8, 262–275 (1968). https://doi.org/10.1007/BF01933436

Download citation

  • Issue date:

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

Key words