{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:16:02Z","timestamp":1759335362033},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540069584","type":"print"},{"value":"9783540372639","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1974]]},"DOI":"10.1007\/3540069585_49","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:40:19Z","timestamp":1330184419000},"page":"109-120","source":"Crossref","is-referenced-by-count":3,"title":["Lexical analysis"],"prefix":"10.1007","author":[{"given":"Franklin L.","family":"DeRemer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"5_CR1","series-title":"Technical Report","volume-title":"Transformational grammars for languages and compilers","author":"F. L. DeRemer","year":"1973","unstructured":"DeRemer, F. L.: Transformational grammars for languages and compilers, Technical Report No. 50, Computing Laboratory, University of Newcastle upon Tyne, England, July 1973"},{"key":"5_CR2","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1145\/362007.362035","volume":"13","author":"J. Early","year":"1970","unstructured":"Early, J.: An efficient context-free parsing algorithm. Comm. ACM 13, 94\u2013102 (1970)","journal-title":"Comm. ACM"},{"key":"5_CR3","volume-title":"Compiler construction for digital computers","author":"D. Gries","year":"1971","unstructured":"Gries, D.: Compiler construction for digital computers. New York: John Wiley and Sons 1971"},{"key":"5_CR4","volume-title":"Formal languages and their relation to automata","author":"J. E. Hopcroft","year":"1969","unstructured":"Hopcroft, J. E., Ullman, J.D.: Formal languages and their relation to automata. Reading (Mass.): Addison-Wesley 1969"},{"key":"5_CR5","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1145\/364175.364185","volume":"11","author":"W. R. Johnson","year":"1968","unstructured":"Johnson, W. R., Porter J.S., Ackley S.I., Ross D. T.: Automatic generation of efficient lexical processors using finite state techniques. Comm. ACM 11, 805\u2013813 (1968)","journal-title":"Comm. ACM"},{"key":"5_CR6","first-page":"3","volume-title":"Automata Studies","author":"S. Kleene","year":"1956","unstructured":"Kleene, S.: Representation of events in nerve-sets. In: Automata Studies, Princeton (N.J.): Princeton Univ. Press 1956, pp. 3\u201342"}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/3540069585_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T05:28:57Z","timestamp":1549171737000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3540069585_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974]]},"ISBN":["9783540069584","9783540372639"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3540069585_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1974]]}}}