Skip to main content
SpringerLink
Log in

Decompiling context-free languages from their Polish-like representations

  • Published:
CALCOLO Aims and scope Submit manuscript

Abstract

A general definition of Polish representation is given for the class of context-free languages and the conditions allowing unique inversion of the representation are studied.

Two algorithms are presented for decompiling an important subclass of Polish representations. Both left-to-right and right-to-left processing is considered.

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. A. V. Aho, J. D. Ullman,Syntax directed translation and the push-down assembler. J. Comput. System Sci.,3, (1969), 37–56.

    MATH  MathSciNet  Google Scholar 

  2. A. V. Aho, J. D. Ullman,The theory of parsing translation and compiling (1973). Vol. I–II, Prentice-Hall, Englewood Cliffs, N. J.

    Google Scholar 

  3. D. Balbinot, L. Petrone,Decompilation of Polish code in Basic, Rivista di Informatica (4),9, (1979), 329–335.

    Google Scholar 

  4. M. N. Bert, L. Petrone,Decompiling context-free languages from their Polish-like representations. Rep. Ist. Scienze dell'Informazione, Univ di Torino, April 1977.

  5. M. N. Bert, L. Petrone,Relaxing syntax to simplify syntax-directed translations. Proc. Informatica '77, Bled, 3.205, (1977).

  6. P. J. Brown Re-creation of source code from reverse Polish form. Software-Practice and Experience,2, (1972), 275–278.

    Article  MATH  Google Scholar 

  7. P. J. Brown,More on the re-creation of source code from reverse Polish. Software-Practice and Experience,7, (1977), 545–551.

    Article  MATH  Google Scholar 

  8. C. C. Charlton, P. G. Hibbard,A note on recreating source code from the reverse Polish form. Software-Practice and Experience,3, (1973), 151–153.

    Google Scholar 

  9. M. H. Halstead,Machine independent computer programming (1962), Spartan Books, New York, N. Y.

    MATH  Google Scholar 

  10. M. H. Halstead,Using the computer for program conversion. Datamation,5, (1970), 125–129.

    Google Scholar 

  11. B. C. Housel, M. H. Halstead,A methodology for machine language decompilation. Proc. ACM Conf. (1974), 254–260.

  12. M. C. Paull, S. H. Unger,Structural equivalence of context-free grammars, J. Comput. System Sci.2, (1968), 427–463.

    MATH  MathSciNet  Google Scholar 

  13. L. Petrone,Syntax directed mappings of context-free languages. 9-th Ann. Symp. on Swit. Circuits and Automata Theory, Schenect., N. Y., (1968).

  14. V. Schneider, G. Winiger,Translation grammars for compilation and decompilation, BIT,14, (1974), 78–86.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CSELT, Via G. Reiss Romoli 274, 10148, Torino

    M. N. Bert

  2. Istituto di Scienze dell'Informazione, Università di Torino, Corso M. D'Azeglio 42, 10125, Torino, Italy

    L. Petrone

Authors
  1. M. N. Bert
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. Petrone
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bert, M.N., Petrone, L. Decompiling context-free languages from their Polish-like representations. Calcolo 19, 35–57 (1982). https://doi.org/10.1007/BF02576191

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation