A short review of high speed compilation

  • Werner Aßmann
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 371)


Starting with some considerations about the need for a higher speed of program development the term “High Speed Compilation” will be introduced. High speed compilers should have a speed of more than 30,000 lines per minute. High speed programming systems must be able to run through the edit/compile/link/load/run/debug phases with a waiting time less than 10 seconds. Starting with this definitions some demands on the components of compilers and programming systems are derived. Current known and applicable methods to reach this goal are discussed. This methods are divided in “Tuning” and “Better Algorithms”. The effect of incremental compilation as a newer compilation technique is shown by the INDIA programming system.


Lexical Analysis Fast Search Method Compiler Compiler Natural Language Lexicon Hash Search 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [1]
    W. Aßmann The INDIA System for Incremental Dialog Programming Proceedings of Workshop on Compiler Compilers and Incremental Compilation, Berlin, 1986 IIR-Informationen 2(1986)12,12–34Google Scholar
  2. [2]
    C.C. Chang An Ordered Minimal Perfect Hashing Scheme Based upon Euler's Theorem Information Sciences 32(1984),165–172Google Scholar
  3. [3]
    N. Cercone, M. Krause, J. Boates Minimal and Almost Minimal Perfect Hash Function Search with Application to Natural Language Lexicon Design Comp. & Math. with Appl. 9(1983)1,215–231Google Scholar
  4. [4]
    G.V. Cormack, R.N.S. Horspool, M. Kaiserswerth Practical Perfect Hashing The Computer Journal 28(1985)1,54–58Google Scholar
  5. [5]
    P. Fritzson Incremental Symbol Processing Proceedings of Workshop on Compiler Compiler and High Speed Compilation, Berlin, 1988 (to appear in this issue)Google Scholar
  6. [6]
    R. Gerardy Experimental Comparison of Some Parsing Methods SIGPLAN Notices 22(1987)8,79–88Google Scholar
  7. [7]
    J. Grosch Generators for High-Speed Front-Ends Proceedings of Workshop on Compiler Compiler and High Speed Compilation, Berlin, 1988 (to appear in this issue)Google Scholar
  8. [8]
    V.P. Heuring The Automatic Generation of Fast Lexical Analysers Software-Practice and Experience 16(1986)9,801–808Google Scholar
  9. [9]
    R.N. Horspool Hashing as a Compaction Technique for LR Parser Tables Software-Practice and Experience 17(1987)6,413–416Google Scholar
  10. [10]
    T.J. Pennello Very Fast LR Parsing 1986 ACM 0-89791-197-0/86/0600-0145 75cGoogle Scholar
  11. [11]
    D.J. Rosenkrantz, H.B. Hunt Efficient Algorithms for Automatic Construction and Compactification of Parsing Grammars ACM Transactions on Programming Languages and Systems 9(1987)4,543–566Google Scholar
  12. [12]
    T.J. Sager A Polynomial Time Generator for Minimal Perfect Hash Functions Communications of the ACM 28(1985)5,523–532Google Scholar
  13. [13]
    T.J. Sager A Technique for Creating Small Fast Compiler Frontends SIGPLAN Notices 20(1985)10,87–94Google Scholar
  14. [14]
    L. Schmitz On the Correct Elimination of Chain Productions from LR Parsers Intern. J. Computer Math. 15(1984),99–116Google Scholar
  15. [15]
    W.M. Waite The Cost of Lexical Analysis Software-Practice and Experience 16(1986)5,473–488Google Scholar
  16. [16]
    M. Whitney, R.N. Horspool Extremely Rapid LR Parsing Proceedings of Workshop on Compiler Compiler and High Speed Compilation, Berlin, 1988 (to appear in this issue)Google Scholar
  17. [17]
    D.A. Wolverton A Perfect Hash Function for Ada Reserved Words Ada Letters IV(1984)1,40–44Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Werner Aßmann
    • 1
  1. 1.Institute of Informatics and Computing TechniquesAcademy of Sciences of the G.D.R.USA

Personalised recommendations