{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T01:42:16Z","timestamp":1726450936378},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,4,1]],"date-time":"1996-04-01T00:00:00Z","timestamp":828316800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Languages"],"published-print":{"date-parts":[[1996,4]]},"DOI":"10.1016\/0096-0551(96)00003-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:53:54Z","timestamp":1027608834000},"page":"27-38","source":"Crossref","is-referenced-by-count":8,"title":["Mealy machines are a better model of lexical analyzers"],"prefix":"10.1016","volume":"22","author":[{"given":"Wuu","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1979","author":"Hopcroft","key":"10.1016\/0096-0551(96)00003-3_BIB1"},{"key":"10.1016\/0096-0551(96)00003-3_BIB2","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/BF01213079","article-title":"On the look-ahead problem in lexical analysis","volume":"32","author":"Yang","year":"1995","journal-title":"ACTA Informatica"},{"year":"1985","author":"Wirth","key":"10.1016\/0096-0551(96)00003-3_BIB3"},{"key":"10.1016\/0096-0551(96)00003-3_BIB4","doi-asserted-by":"crossref","first-page":"1170","DOI":"10.1145\/7902.7903","article-title":"Data parallel algorithms","volume":"29","author":"Hillis","year":"1986","journal-title":"Comm. ACM"},{"year":"1986","author":"Aho","key":"10.1016\/0096-0551(96)00003-3_BIB5"},{"year":"1991","author":"Fischer","key":"10.1016\/0096-0551(96)00003-3_BIB6"},{"key":"10.1016\/0096-0551(96)00003-3_BIB7","series-title":"The Theory of Machines and Computations","first-page":"189","article-title":"An n log n algorithm for minimizing states in a finite automaton","author":"Hopcroft","year":"1971"},{"key":"10.1016\/0096-0551(96)00003-3_BIB8","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","article-title":"Efficient string matching: an aid to bibliographic search","volume":"18","author":"Aho","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0096-0551(96)00003-3_BIB9","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1145\/14947.888678","article-title":"Alex\u2014a simple and efficient scanner generator","volume":"21","author":"M\u00f6ssenb\u00f6ck","year":"1986","journal-title":"ACM SIGPLAN Notices"},{"key":"10.1016\/0096-0551(96)00003-3_BIB10","first-page":"39","article-title":"LEX\u2014A Lexical Analyzer Generator","author":"Lesk","year":"1975"},{"year":"1990","author":"Paxson","key":"10.1016\/0096-0551(96)00003-3_BIB11"},{"year":"1990","author":"Koskimies","key":"10.1016\/0096-0551(96)00003-3_BIB12"},{"key":"10.1016\/0096-0551(96)00003-3_BIB13","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1002\/spe.4380200503","article-title":"LexAGen: an interactive incremental scanner generator","volume":"20","author":"Szafron","year":"1990","journal-title":"Software\u2014Practice and Experience"},{"key":"10.1016\/0096-0551(96)00003-3_BIB14","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0020-0190(91)90089-Z","article-title":"Conflict detection and resolution in a lexical analyzer generator","volume":"38","author":"Nawrocki","year":"1991","journal-title":"Information Processing Letters"},{"key":"10.1016\/0096-0551(96)00003-3_BIB15","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1002\/j.1097-024X.1986.tb00011.x","article-title":"The automatic generation of fast lexical analysers","volume":"16","author":"Heuring","year":"1986","journal-title":"Software\u2014Practice and Experience"},{"key":"10.1016\/0096-0551(96)00003-3_BIB16","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1002\/spe.4380191106","article-title":"Efficient generation of lexical analysers","volume":"19","author":"Grosch","year":"1989","journal-title":"Software\u2014Practice and Experience"},{"key":"10.1016\/0096-0551(96)00003-3_BIB17","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1002\/spe.4380170602","article-title":"Mkscan\u2014an interactive scanner generator","volume":"17","author":"Horspool","year":"1987","journal-title":"Software\u2014Practice and Experience"},{"key":"10.1016\/0096-0551(96)00003-3_BIB18","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/133233.133240","article-title":"Incremental generation of lexical scanners","volume":"14","author":"Heering","year":"1992","journal-title":"ACM Trans. Programming Lang. Systems"},{"key":"10.1016\/0096-0551(96)00003-3_BIB19","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1002\/spe.4380221106","article-title":"ALADIN: a scanner generator for incremental programming environments","volume":"22","author":"Fische","year":"1992","journal-title":"Software\u2014Practice and Experience"},{"key":"10.1016\/0096-0551(96)00003-3_BIB20","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1109\/32.83901","article-title":"Incremental scanning and parsing with Galaxy","volume":"17","author":"Beetem","year":"1991","journal-title":"IEEE Trans. Software Engineering"},{"key":"10.1016\/0096-0551(96)00003-3_BIB21","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","article-title":"Fast pattern matching in strings","volume":"6","author":"Knuth","year":"1977","journal-title":"SIAM J. Computing"}],"container-title":["Computer Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055196000033?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055196000033?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,9]],"date-time":"2023-04-09T12:10:11Z","timestamp":1681042211000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0096055196000033"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,4]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,4]]}},"alternative-id":["0096055196000033"],"URL":"https:\/\/doi.org\/10.1016\/0096-0551(96)00003-3","relation":{},"ISSN":["0096-0551"],"issn-type":[{"type":"print","value":"0096-0551"}],"subject":[],"published":{"date-parts":[[1996,4]]}}}