{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T10:16:22Z","timestamp":1777371382201,"version":"3.51.4"},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"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, Systems & Structures"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0096-0551(02)00014-0","type":"journal-article","created":{"date-parts":[[2003,2,4]],"date-time":"2003-02-04T20:48:55Z","timestamp":1044391735000},"page":"273-288","source":"Crossref","is-referenced-by-count":4,"title":["On the applicability of the longest-match rule in lexical analysis"],"prefix":"10.1016","volume":"28","author":[{"given":"Wuu","family":"Yang","sequence":"first","affiliation":[]},{"given":"Chey-Woei","family":"Tsay","sequence":"additional","affiliation":[]},{"given":"Jien-Tsai","family":"Chan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0096-0551(02)00014-0_BIB1","series-title":"Introduction to automata theory, languages, and computation","author":"Hopcroft","year":"1979"},{"issue":"1","key":"10.1016\/S0096-0551(02)00014-0_BIB2","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0096-0551(96)00003-3","article-title":"Mealy machines are a better model of lexical analyzers","volume":"22","author":"Yang","year":"1996","journal-title":"Computer Languages"},{"key":"10.1016\/S0096-0551(02)00014-0_BIB3","series-title":"Compilers: Principles, Techniques, and Tools","author":"Aho","year":"1986"},{"key":"10.1016\/S0096-0551(02)00014-0_BIB4","series-title":"Crafting a compiler with C","author":"Fischer","year":"1991"},{"key":"10.1016\/S0096-0551(02)00014-0_BIB5","series-title":"The annotated C++ reference manual","author":"Ellis","year":"1990"},{"key":"10.1016\/S0096-0551(02)00014-0_BIB6","series-title":"Programming with modula-2","author":"Wirth","year":"1983"},{"key":"10.1016\/S0096-0551(02)00014-0_BIB7","unstructured":"Lesk ME, Schmidt E. LEX\u2014a lexical analyzer generator. Computer Science Technical Report 39, Bell Labs., Murray Hill, NJ, 1975."},{"issue":"2","key":"10.1016\/S0096-0551(02)00014-0_BIB8","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/129630.129637","article-title":"Eli","volume":"35","author":"Gray","year":"1992","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0096-0551(02)00014-0_BIB9","unstructured":"Parr T, Language translation using PCCTS and C++: a reference guide. San Jose, CA: Automata Publishing, 1997. A pre-release version is available from ftp:\/\/ftp.parr-research.com\/pub\/pccts\/Book\/reference.ps."},{"key":"10.1016\/S0096-0551(02)00014-0_BIB10","series-title":"The theory of parsing, translation, and compiling: parsing","author":"Aho","year":"1972"},{"issue":"1","key":"10.1016\/S0096-0551(02)00014-0_BIB11","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1093\/comjnl\/12.1.41","article-title":"Proving properties of programs by structural induction","volume":"12","author":"Burstall","year":"1969","journal-title":"The Computer Journal"},{"issue":"2","key":"10.1016\/S0096-0551(02)00014-0_BIB12","first-page":"287","article-title":"A lattice framework for analyzing context-free languages with applications in parser simplication and data-flow analysis","volume":"15","author":"Yang","year":"1999","journal-title":"Journal of Information Science and Engineering"},{"key":"10.1016\/S0096-0551(02)00014-0_BIB13","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"}],"container-title":["Computer Languages, Systems & Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096055102000140?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096055102000140?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T02:57:34Z","timestamp":1553914654000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0096055102000140"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0096055102000140"],"URL":"https:\/\/doi.org\/10.1016\/s0096-0551(02)00014-0","relation":{},"ISSN":["1477-8424"],"issn-type":[{"value":"1477-8424","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}