Skip to main content
SpringerLink
Log in

Developments in Compiler Writing Systems

  • Conference paper
GI — 6. Jahrestagung

Part of the book series: Informatik — Fachberichte ((INFORMATIK,volume 5))

Abstract

Compiler writing systems have been a popular research topic within the field of programming languages ever since the pioneering work of Brooker and Morris ([8],[9]) in the early 1960’s. By 1967 several different systems had evolved. The characteristics of these systems were excellently expounded in the state-of-the-art survey by Feldman and Gries [20], which is still a must for anyone interested in compiler writing systems.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A. V.: Language theory in compiler design. In Applied computation theory: analysis, design, modeling (ed R. T. Yeh), Prentice-Hall, Inc., Englewood Cliffs, N.J., 1976, pp.185–249.

    Google Scholar 

  2. Aho, A. V. & J.D. Ullman: The theory of parsing, translation and compiling. Vol.1: Parsing. Prentice-Hall, Inc., Englewood Cliffs, N.J., 1972.

    Google Scholar 

  3. Anderson, T., J. Eve & J. J. Horning: Efficient LR(1) parsers. Acta Informatica 2, 1 (1973), 12–39.

    Article  MathSciNet  MATH  Google Scholar 

  4. Barnard, D. T.: Automatic generation of syntax-repairing and paragraphing parsers. University of Toronto, Computer Systems Research Group, Technical Report CSRG-52, April 1975.

    Google Scholar 

  5. Bauer, F. L. & J. Eickel (eds): Compiler construction: an advanced cource. Springer-Verlag, Berlin — Heidelberg — New York, 1974.

    Google Scholar 

  6. Bochmann, G. V.: Semantic attributes for grammars with regular expressions. Université de Montréal, Département d’Informatique, Publication 195, 1975.

    Google Scholar 

  7. Bosch, R., D. Grune, L. Meertens: ALEPH, a language encouraging program hierarchy. International Computing Symposium 1973 (eds A. Günther, B. Levrat & H. Lipps), North-Holland Publ. Co., Amsterdam — London, 1974, pp.73–79.

    Google Scholar 

  8. Brooker, R. A., J. R. MacCallum, D. Morris & J. S. Rohl: The compiler compiler. Annual Review in Automatic Programming, vol.3, 1963, pp.229–275.

    Article  Google Scholar 

  9. Brooker, R. A. & D. Morris: A general translation program for phrase structure languages. J. ACM 9, 1 (January 1962), 1–10.

    Article  MathSciNet  MATH  Google Scholar 

  10. Ciesinger, J.: Generating error recovery in a compiler generating system. GI — 4.Fachtagung über Programmiersprachen, Springer-Verlag, Berlin — Heidelberg — New York, 1976, pp.185–193.

    Google Scholar 

  11. Cohen, J.: Experience with a conversational parser generating system. Software — Practice & Experience 5,2 (April — June 1975), 169–180.

    Article  MATH  Google Scholar 

  12. DeRemer,F.L.: Lexical analysis. In [5], pp.109–120.

    Google Scholar 

  13. DeRemer, F. L.: Simple LR(k) grammars. Comm. ACM 14,7 (July 1971), 453–460.

    Article  MathSciNet  MATH  Google Scholar 

  14. DeRemer, F. L.: Syntax charts constructed automatically. University of California, Santa Cruz, 1975.

    Google Scholar 

  15. DeRemer,F.L.: Transformational grammars. In [5], pp.121–145.

    Google Scholar 

  16. Dove,R.K.: Design highlights of CABAL — a compiler-compiler. Proc. AFIPS 1968 Fall Joint Computer Conference, vol.33, part two, pp.1321–1328.

    Google Scholar 

  17. Ershov, A. P.: Problems in many-language systems. International Summer School on Language Hierarchies and Interfaces, Munich, July 1975.

    Google Scholar 

  18. Fang, I.: Folds, a declarative formal language definition system. Stanford University, Computer Science Department, STAN-CS-72–329, December 1972.

    Google Scholar 

  19. Feldman, J. A.: A formal semantics for computer languages and its application in a compiler-compiler. Comm. ACM 9,1 (January 1966), 3–9.

    Article  MATH  Google Scholar 

  20. Feldman, J. A. & D. Gries: Translator writing systems. Comm. ACM 11,2 (February 1968), 77–113.

    Article  MATH  Google Scholar 

  21. Feyock, S. & P. Lazarus: Syntax-directed correction of syntax errors. Software — Practice & Experience 6,2 (April — June 1976), 207–219.

    Article  MATH  Google Scholar 

  22. Frommwieser, H.: Implementierung eines Minimalsystems zur maschinenunabhängigen Codeerzeugung. Technische Universität München, Abteilung Mathematik, Diplomarbeit, Juli 1974.

    Google Scholar 

  23. Ganzinger, H.: Modifizierte attributierte Grammatiken. Technische Universität München, Abteilung Mathematik, Bericht Nr. 7420, November 1974.

    Google Scholar 

  24. Graham, S. L. S. S. P. Rhodes: Practical syntactic error recovery. Comm. ACM 18,11 (November 1975), 639–650.

    Article  MATH  Google Scholar 

  25. Gries, D.: Compiler construction for digital computers. John Wiley & Sons, Inc., New York, 1971.

    MATH  Google Scholar 

  26. Gries, D.: CIL — a compiler implementation language. Stanford University, Stanford Linear Accelerator Center, SLAC-102, March 1969.

    Google Scholar 

  27. Griffiths,M.: Introduction to compiler-compilers. In [5], pp.356–365.

    Google Scholar 

  28. Griffiths,M.: LL(1) grammars and analysers. In [5], pp.57–84.

    Google Scholar 

  29. Hammer, M.: The design of usable programming languages. Proc. ACM 1975 Annual Conference, October 1975, pp.225–229.

    Google Scholar 

  30. Horning, J. J.: LR grammars and analyzers. In [5], pp.85–108.

    Google Scholar 

  31. Horning, J. J.: What the compiler should tell the user. In [5], pp.525–548.

    Google Scholar 

  32. Irons, E. T.: A syntax directed compiler for Algol 60. Comm. ACM 4,1 (January 1961), 51–55.

    Article  MATH  Google Scholar 

  33. Jazayeri, M. & K. G. Walter: Alternating semantic evaluator. Proc. ACM 1975 Annual Conference, October 1975, pp.230–234.

    Google Scholar 

  34. Johnson, S. C.: YACC — yet another compiler-compiler. Bell Laboratories, Computing Science Technical Report 32, July 1975.

    Google Scholar 

  35. Johnson, W. L., J. H. Porter, S. I. Ackley & D. T. Ross: Automatic generation of efficient lexical processors using finite state techniques. Comm. ACM 11,12 (December 1968), 805–813.

    Article  MATH  Google Scholar 

  36. Kastens, U.: Systematische Analyse semantischer Abhaengigkeiten. GI — 4.Fachtagung über Programmiersprachen, Springer-Verlag, Berlin — Heidelberg — New York, 1976, pp.19–32.

    Google Scholar 

  37. Kennedy, K. & S. K. Warren: Automatic generation of efficient evaluators for attribute grammars. Proc. Third ACM Symposium on Principles of Programming Languages, January 1976, pp.32–49.

    Google Scholar 

  38. Knuth, D. E.: Semantics of context-free languages. Math. Systems Theory 2,2 (1968), 127–145.

    Article  MathSciNet  MATH  Google Scholar 

  39. Koster,C.H.A.: Using the CDL compiler-compiler. In [5], pp.366–426.

    Google Scholar 

  40. Kron, H. H., H-J. Hoffmann & G. Winkler: On a SLR(k)-based parser system which accepts non-LR(k) grammars. GI — 4. Jahrestagung (ed D. Siefkes), Springer-Verlag, Berlin — Heidelberg — New York, 1975, pp.214–223.

    Google Scholar 

  41. Krzemien, R. & A. Łukasiewicz : Automatic generation of lexical analyzers in a compiler-compiler. Information Processing Letters 4,6 (March 1976), 165–168.

    Article  MATH  Google Scholar 

  42. Lalonde, W. R., E. S. Lee & J. J. Horning: An LALR(k) parser generator. Proc. IFIP 1971 Congress, North-Holland Publ. Co., Amsterdam — London, 1972, pp.513–518.

    Google Scholar 

  43. Lancaster, R. L. & V. B. Schneider: Quick compiler construction using uniform code generators. Software — Practice & Experience 6,1 (January — March 1976), 83–91.

    Article  MATH  Google Scholar 

  44. Lecarme, O. L. & G. V. Bochmann: A (truly) usable and portable compiler writing system. Proc. IFIP 1974 Congress, North-Holland Publ. Co., Amsterdam — London, 1974, pp.218–221.

    Google Scholar 

  45. Lesk, M. E.: Lex — a lexical analyzer generator. Bell Laboratories, Computing Science Technical Report 39, October 1975.

    Google Scholar 

  46. Lewi, J., K. De Vlaminck, J. Huens & P. Mertens: SLS/1: a translator writing system. GI — 5.Jahrestagung (ed J. Mühlbacher)., Springer-Verlag, Berlin — Heidelberg — New York, 1975, pp.627–641.

    Google Scholar 

  47. Lewis, P. M., D. J. Rosenkrantz & R. E. Stearns: Compiler design theory. Addison-Wesley Publ. Co., Reading, Mass., 1976.

    MATH  Google Scholar 

  48. Lorho, B.: De la définition à la traduction des langages de programmation: méthode des attributs sémantiques. Université Paul Sabatier, Toulouse, Thèse d’Etat, 1974.

    Google Scholar 

  49. Lynch, W. C. & H. L. Pierson: A finite state transducer model for compiler lexical scanners. Proc. IFIP 1968 Congress. North-Holland Publ. Co., Amsterdam, 1969, pp.448–455.

    Google Scholar 

  50. Machado, N. C.: ISL — a semantic language for a translator writing system. University of Illinois at Urbana-Champaign, Department of Computer Science, Report No. 367, December 1969.

    Google Scholar 

  51. McKeeman, W. M., J. J. Horning & D. B. Wortman: A compiler generator. Prentice-Hall, Inc., Englewood Cliffs, N.J., 1970.

    Google Scholar 

  52. Mickunas, M. D. & V. B. Schneider: A parser generating system for constructing compressed compilers. Comm. ACM 16, 11 (November 1973), 669–674.

    Article  MATH  Google Scholar 

  53. Miller, P. L.: Automatic creation of a code generator from a machine description. Massachusetts Institute of Technology, Project MAC, TR-85, May 1971.

    Google Scholar 

  54. Newcomer, J. M.: Machine—independent generation of optimal local code. Carnegie-Mellon University, Department of Computer Science, May 1975.

    Google Scholar 

  55. Pager, D.: On eliminating unit productions from LR(k) parsers. Second Colloquium on Automata, Languages and Programming (ed J.Loeckx), Springer-Verlag, Berlin — Heidelberg — New York, 1974, pp.242–254.

    Google Scholar 

  56. Petrick, S. R.: On the use of syntax-based translators for symbolic and algebraic manipulation. Proc. Second Symposium on Symbolic and Algebraic Manipulation, March 1971, pp.224–237.

    Google Scholar 

  57. Ripken, K.: Ein Programmsystem zur automatischen Erzeugung von Leseprogrammen. Technische Universität München, Abteilung Mathematik, Bericht 7417, September 1974.

    Google Scholar 

  58. Räihä, K-J.: On compiler writing systems. Proc. NordDATA 76 Conference, Finnish Data Processing Association, June 1976, pp.668–679.

    Google Scholar 

  59. Räihä, K-J.: Design of the semantic phase of a compiler writing system (in Finnish). University of Helsinki, Department of Computer Science, Series C, Number 1976/24, January 1976.

    Google Scholar 

  60. Saarinen, M.: Design of the lexical analyzer of a compiler writing system (in Finnish). University of Helsinki, Department of Computer Science, Series C, Number 1976/23, January 1976.

    Google Scholar 

  61. Sippu, S. S.: Error recovery in LR-parsing (in Finnish). University of Helsinki, Department of Computer Science, Series C, Number 1976/22, February 1976.

    Google Scholar 

  62. Soisalon-Soininen, E.: Design of an automatic constructor of LR-parsers (in Finnish). University of Helsinki, Department of Computer Science, Series C, Number 1976/27, January 1976.

    Google Scholar 

  63. Soisalon-Soininen, E. & E. Ukkonen: A characterization of LL(k) languages. Third Colloquium on Automata, Languages and Programming, Edinburgh, July 1976.

    Google Scholar 

  64. White, J. R. & L. Presser: A structured language for translator construction. Computer J. 18,1 (February 1975), 34–42.

    Google Scholar 

  65. Wilhelm, R.: Code-Optimierung mittels attributierter Transformationsgrammatiken. GI — 4.Jahrestagung (ed D. Siefkes), Springer-Verlag, Berlin — Heidelberg — New York, 1975, pp.257–266.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Helsinki, Töölönkatu 11, SF-00100, Helsinki 10, Finland

    Kari-Jouko Räihä & Mikko Saarinen

Authors
  1. Kari-Jouko Räihä
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mikko Saarinen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität Stuttgart, Herdweg 51, D-7000, Stuttgart 1, Deutschland

    Erich J. Neuhold

Rights and permissions

Reprints and permissions

Copyright information

© 1976 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

Räihä, KJ., Saarinen, M. (1976). Developments in Compiler Writing Systems. In: Neuhold, E.J. (eds) GI — 6. Jahrestagung. Informatik — Fachberichte, vol 5. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-95289-0_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-95289-0_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07912-5

  • Online ISBN: 978-3-642-95289-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation