Myths and facts about the efficient implementation of finite automata and lexical analysis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1383, Issue , 1998, Pages 1-15

  Brouwer, Klaus ^a   Gellerich, Wolfgang ^a   Ploedereder, Erhard ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

Author keywords

Finite automata; Lexical analysis; Run time efficiency; Scanner

Indexed keywords

FINITE AUTOMATA; PROGRAM COMPILERS; SCANNING;

CACHE MISS; COMPILER CONSTRUCTION; EFFICIENT IMPLEMENTATION; IMPLEMENTATION STRATEGIES; LEXICAL ANALYSIS; RUN-TIME EFFICIENCY; RUNTIMES; SCANNER;

COMPUTATIONAL LINGUISTICS;

EID: 84958043690     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0026419     Document Type: Conference Paper

References (39)

1. Ada 95 Reference Manual. Intermetrics, Inc., 1995. ANSI/ISO/IEC-8652:1995.
2. A.V. Aho and M.J. Corasick. Efficient String Matching: An Aid to Bibliographic Search. Communications of the ACM, 18(6):333-340, June 1975.
3. A.V. Aho, R. Sethi, and J.D. Ullman. Compilers. Addison-Wesley, 1986.
4. J. Barnes. Programming in Ada 95. Addison Wesley, 1995.
5. P. Bumbulis and D.D. Cowan. RE2C: A More Versatile Scanner Generator. ACM Letters on Programming Languages and Systems, 2(1-4):70-84, 1993.
6. R.J. Cichelli. Minimal Perfect Hash Functions Made Simple. Communications of the ACM, 23:17-19, 1980.
7. C.R. Cook and R.R. Oldehoeft. A Letter Oriented Minimal Perfect Hashing Function. ACM SIGPLAN Notices, 17(9):18-27, 1982.
8. Z.J. Czech and G. Havas. An optimal algorithm for generating minimal perfect hash functions. Information Processing Letters, 43(5):257-264, October 1992.
9. R. Dewar. (private communication).
10. C.W. Fraser and D.R. Hanson. A Retargetable C Compiler. ACM SIGPLAN Notices, 26(10):29-43, October 1991.
11. C.W. Fraser and D.R. Hanson. A Retargetable C Compiler. Addison-Wesley, 1995.
12. Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307 USA. Using and Porting GNU CC, 1995. (for GCC Version 2.7.2).
13. W. Gellerich, M. Kosiol, and E. Ploedereder. Where does goto go to? In Reliable Software Technologies - Aria-Europe 1996, volume 1088 of LNCS, pages 385-395. Springer, 1996. (http://www.informatik.uni-stuttgart.de/ifi/ps/Gellerich/adagotowww.ps).
14. Gnu ada translator (gnat) documentation, 1995. (ftpcs.nyu.edu:/pub/gnat).
15. R.W. Gray, V. Heurig, S.P. Levi, A.M. Sloane, and W.M. Waite. Eli: A complete, flexible compiler construction system. CACM, 35(2):121-131, February 1992.
16. J. Grosch. Generators for High-Speed Front-Ends. In Compiler-Compilers and High-Speed Compilation, volume 371 of LNCS, pages 81-92. Springer, 1988.
17. J. Grosch. Selected Examples of Scanner Specifications. Technical Report 7, Gesetlschaft fuer Mathematik und Datenverarbeitung mbH, 1988.
18. J. Grosch. Efficient Generation of Lexical Analysers. Software Practice and Experience, 19(11):1089-1103, November 1989.
19. J. Grosch. Rex - A Scanner Generator. Technical Report 5, GeseUschaft filer Mathematik und Datenverarbeitung mbH, 1992.
20. G. Havas and B.S. Majewski. Graph Theoretic Obstacles to Perfect Hashing. Congressus Numerantium, 98:81-93, 1993.
21. Intel Corporation. Pentium Processor Family Developer's Manual, 1997.
22. SPARC International. SPARC Architecture Manual, Vers. 8. Prentice Hall, 1992.
23. W.L. Johnson, J.H. Porter, S.I. Ackley, and D.T. Ross. Automatic Generation of Efficient Lexical Processors Using Finite State Techniques. ACM SIGPLAN Notices, 11(8):805-813, December 1968.
24. D.W. Jones. How (Not) to Code a Finite State Machine. ACM SIGPLAN Notices, 23(8):19-22, 1988.
25. J.R. Levine, T. Mason, and D. Brown. lex & yacc. O'Reilly & Associates, Inc., Sebastopol, 2. edition, 1990.
26. SUN Microsystems. Solaris 2.3 Software Developer Answerbook, November 1993.
27. H. Moessenboeck. Alex- a simple and efficient scanner generator. ACM SIGPLAN Notices, 21(5):69-78, May 1986.
28. Vern Paxon. Flex, Version 2. 5. University of California, Berkeley, March 1995.
29. U. Post. Gleitzeit - Performance Monitoring deckt Gleitkommanutzung auf, pages 256-259, Sep 1997.
30. Ada version of REX. (www.informatik.uni-stuttgart.de/ifi/ps/cocktail).
31. J. Self. Aflex - An Ada Lexical Analyzer Generator. Technical Report UCI-90-18, University of California, Irvine, May 1990.
32. D. Szafron and R. Ng. LexAGen: An Interactive Incremental Scanner Generator. Software - Practice and Experience, 20(5):459-483, 1990.
33. W.F. Tichy, P. Lukowicz, Lutz Prechelt, and E.A. Heinz. Experimental Evaluation in Computer Science: A Quantitative Study. Journal of Systems and Software, 28(1):9-18, Januar 1995.
34. J.P. Tremblay and P.G. Sorenson. The Theory and Praxis of Compiler Writing. McGraw-Hill, 1985.
35. W.M. Waite. The Cost of Lexical Analysis. Software - Practice and Experience, 16(5):473-488, 1986.
36. D.L. Weaver and T. Germond. SPARC Architecture Manual, Version 9. Prentice Hall, 1994.
37. R. Wilhelm and D. Maurer. Compiler Design. Addison-WesleySpringer, 1995.
38. M. Withopf and A. Stiller. Durchgriff- Direkte Zugriffe unter Windows NT 4.0 und ein entfesselter Cyrix 6x86. c't, pages 312-315, Jan 1997.
39. D.A. Wolverton. A Perfect Hash Function for Ada Reserved Words. ACM Ada Letters, VI(1):40-44, July/August 1984.