{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:37:51Z","timestamp":1725896271195},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540643043"},{"type":"electronic","value":"9783540697244"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0026419","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T07:48:42Z","timestamp":1132386522000},"page":"1-15","source":"Crossref","is-referenced-by-count":3,"title":["Myths and facts about the efficient implementation of finite automata and lexical analysis"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Brouwer","sequence":"first","affiliation":[]},{"given":"Wolfgang","family":"Gellerich","sequence":"additional","affiliation":[]},{"given":"Erhard","family":"Ploedereder","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,15]]},"reference":[{"key":"1_CR1","unstructured":"Ada 95 Reference Manual. Intermetrics, Inc., 1995. ANSI\/ISO\/IEC-8652:1995."},{"issue":"6","key":"1_CR2","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A.V. Aho","year":"1975","unstructured":"A.V. Aho and M.J. Corasick. Efficient String Matching: An Aid to Bibliographic Search. Communications of the ACM, 18(6):333\u2013340, June 1975.","journal-title":"Communications of the ACM"},{"key":"1_CR3","unstructured":"A.V. Aho, R. Sethi, and J.D. Ullman. Compilers. Addison-Wesley, 1986."},{"key":"1_CR4","unstructured":"J. Barnes. Programming in Ada 95. Addison Wesley, 1995."},{"issue":"1-4","key":"1_CR5","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1145\/176454.176487","volume":"2","author":"P. Bumbulis","year":"1993","unstructured":"P. Bumbulis and D.D. Cowan. RE2C: A More Versatile Scanner Generator. ACM Letters on Programming Languages and Systems, 2(1-4):70\u201384, 1993.","journal-title":"ACM Letters on Programming Languages and Systems"},{"key":"1_CR6","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/358808.358813","volume":"23","author":"R.J. Cichelli","year":"1980","unstructured":"R.J. Cichelli. Minimal Perfect Hash Functions Made Simple. Communications of the ACM, 23:17\u201319, 1980.","journal-title":"Communications of the ACM"},{"issue":"9","key":"1_CR7","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/947955.947957","volume":"17","author":"C.R. Cook","year":"1982","unstructured":"C.R. Cook and R.R: Oldehoeft. A Letter Oriented Minimal Perfect Hashing Function. ACM SIGPLAN Notices, 17(9):18\u201327, 1982.","journal-title":"ACM SIGPLAN Notices"},{"issue":"5","key":"1_CR8","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0020-0190(92)90220-P","volume":"43","author":"Z.J. Czech","year":"1992","unstructured":"Z.J. Czech and G. Havas. An optimal algorithm for generating minimal perfect hash functions. Information Processing Letters, 43(5):257\u2013264, October 1992.","journal-title":"Information Processing Letters"},{"key":"1_CR9","unstructured":"R. Dewar. (private communication)."},{"issue":"10","key":"1_CR10","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/122616.122621","volume":"26","author":"C.W. Praser","year":"1991","unstructured":"C.W. Praser and D.R. Hanson. A Retargetable C Compiler. ACM SIGPLAN Notices, 26(10):29\u201343, October 1991.","journal-title":"ACM SIGPLAN Notices"},{"key":"1_CR11","unstructured":"C.W. Fraser and D.R. Hanson. A Retargetable C Compiler. Addison-Wesley, 1995."},{"key":"1_CR12","unstructured":"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)."},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"W. Gellerich, M. Kosiol, and E. Ploedereder. Where does goto go to? In Reliable Software Technologies-Ada-Europe 1996, volume 1088 of LNCS, pages 385\u2013395. Springer, 1996. (http:\/\/www.informatik.uni-stuttgart.de \/ifi\/ps\/Gellerich\/adagotowww.ps ).","DOI":"10.1007\/BFb0013504"},{"key":"1_CR14","unstructured":"Gnu ada translator (gnat) documentation, 1995. (ftp cs.nyu.edu:\/pub\/gnat)."},{"issue":"2","key":"1_CR15","first-page":"121","volume":"35","author":"R.W. Gray","year":"1992","unstructured":"R.W. Gray, V. Heurig, S.P. Levi, A.M. Sloane, and W.M. Waite. Eli: A complete, flexible compiler construction system. CALM, 35(2):121\u2013131, February 1992.","journal-title":"CALM"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"J. Grosch. Generators for High-Speed Front-Ends. In Compiler-Compilers and High-Speed Compilation, volume 371 of LNCS, pages 81\u201392. Springer, 1988.","DOI":"10.1007\/3-540-51364-7_6"},{"key":"1_CR17","unstructured":"J. Grosch. Selected Examples of Scanner Specifications. Technical Report 7, Gesellschaft fuer Mathematik und Datenverarbeitung mbH, 1988."},{"issue":"11","key":"1_CR18","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1002\/spe.4380191106","volume":"19","author":"J. Grosch","year":"1989","unstructured":"J. Grosch. Efficient Generation of Lexical Analysers. Software Practice and Experience, 19(11):1089\u20131103, November 1989.","journal-title":"Software Practice and Experience"},{"key":"1_CR19","unstructured":"J. Grosch. Rex-A Scanner Generator. Technical Report 5, Gesellschaft fuer Mathematik und Datenverarbeitung mbH, 1992."},{"key":"1_CR20","first-page":"81","volume":"98","author":"G. Havas","year":"1993","unstructured":"G. Havas and B.S. Majewski. Graph Theoretic Obstacles to Perfect Hashing. Congressus Numerantium, 98:81\u201393, 1993.","journal-title":"Congressus Numerantium"},{"key":"1_CR21","unstructured":"Intel Corporation. Pentium Processor Family Developer's Manual, 1997."},{"key":"1_CR22","unstructured":"SPARC International. SPARC Architecture Manual, Vers. 8. Prentice Hall, 1992."},{"issue":"8","key":"1_CR23","first-page":"805","volume":"11","author":"W.L. Johnson","year":"1968","unstructured":"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\u2013813, December 1968.","journal-title":"ACM SIGPLAN Notices"},{"issue":"8","key":"1_CR24","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/47907.47908","volume":"23","author":"D.W. Jones","year":"1988","unstructured":"D.W. Jones. How (Not) to Code a Finite State Machine. ACM SIGPLAN Notices, 23(8):19\u201322, 1988.","journal-title":"ACM SIGPLAN Notices"},{"key":"1_CR25","unstructured":"J.R. Levine, T. Mason, and D. Brown. lex & yacc. O'Reilly & Associates, Inc., Sebastopol, 2. edition, 1990."},{"key":"1_CR26","unstructured":"SUN Microsystems. Solaris 2.3 Software Developer Answerbook, November 1993."},{"issue":"5","key":"1_CR27","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1145\/14947.888678","volume":"21","author":"H. Moessenboeck","year":"1986","unstructured":"H. Moessenboeck. Alex-a simple and efficient scanner generator. ACM SIGPLAN Notices, 21(5):69\u201378, May 1986.","journal-title":"ACM SIGPLAN Notices"},{"key":"1_CR28","volume-title":"Flex, Version 2.5","author":"V. Paxon","year":"1995","unstructured":"Vern Paxon. Flex, Version 2.5. University of California, Berkeley, March 1995."},{"key":"1_CR29","unstructured":"U. Post. Gleitzeit-Performance Monitoring deckt Gleitkommanutzung auf. c't, pages 256\u2013259, Sep 1997."},{"key":"1_CR30","unstructured":"Ada version of REX. (www.informatik.uni-stuttgart.de\/ifi\/ps\/cocktail)."},{"key":"1_CR31","volume-title":"Aflex-An Ada Lexical Analyzer Generator","author":"J. Self","year":"1990","unstructured":"J. Self. Aflex-An Ada Lexical Analyzer Generator. Technical Report UCI-90-18, University of California, Irvine, May 1990."},{"issue":"5","key":"1_CR32","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1002\/spe.4380200503","volume":"20","author":"D. Szafron","year":"1990","unstructured":"D. Szafron and R. Ng. LexAGen: An Interactive Incremental Scanner Generator. Software-Practice and Experience, 20(5):459\u2013483, 1990.","journal-title":"Software-Practice and Experience"},{"issue":"1","key":"1_CR33","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0164-1212(94)00111-Y","volume":"28","author":"W.F. Tichy","year":"1995","unstructured":"W.F. Tichy, P. Lukowicz, Lutz Prechelt, and E.A. Heinz. Experimental Evaluation in Computer Science: A Quantitative Study. 01Journal of Systems and Software, 28(1):9\u201318, Januar 1995.","journal-title":"01Journal of Systems and Software"},{"key":"1_CR34","unstructured":"J.P. Tremblay and P.G. Sorenson. The Theory and Praxis of Compiler Writing. McGraw-Hill, 1985."},{"issue":"5","key":"1_CR35","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1002\/spe.4380160508","volume":"16","author":"W.M. Waite","year":"1986","unstructured":"W.M. Waite. The Cost of Lexical Analysis. Software-Practice and Experience, 16(5):473\u2013488, 1986.","journal-title":"Software-Practice and Experience"},{"key":"1_CR36","unstructured":"D.L. Weaver and T. Germond. SPARC Architecture Manual, Version 9. Prentice Hall, 1994."},{"key":"1_CR37","unstructured":"R. Wilhelm and D. Maurer. Compiler Design. Addison-WesleySpringer, 1995."},{"key":"1_CR38","unstructured":"M. Withopf and A. Stiller. Durchgriff-Direkte Zugriffe unter Windows NT 4.0 und ein entfesselter Cyrix 6x86. c't, pages 312\u2013315, Jan 1997."},{"issue":"1","key":"1_CR39","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1145\/998401.998403","volume":"VI","author":"D.A. Wolverton","year":"1984","unstructured":"D.A. Wolverton. A Perfect Hash Function for Ada Reserved Words. ACM Ada Letters, VI(1):40\u201344, July\/August 1984.","journal-title":"ACM Ada Letters"}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0026419","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T01:38:21Z","timestamp":1586569101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0026419"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540643043","9783540697244"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/bfb0026419","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}