{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T02:08:52Z","timestamp":1649038132879},"reference-count":12,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1993,10,1]],"date-time":"1993-10-01T00:00:00Z","timestamp":749433600000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1993,10]]},"DOI":"10.1016\/0020-0190(93)90134-u","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:45:40Z","timestamp":1027655140000},"page":"245-251","source":"Crossref","is-referenced-by-count":0,"title":["On the reduction of LR(k) parsers"],"prefix":"10.1016","volume":"47","author":[{"given":"Woo-Jun","family":"Park","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Myung-Joon","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kwang-Moo","family":"Choe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90134-U_BIB1","volume":"Vols. 1 and 2","author":"Aho","year":"1972-1973"},{"key":"10.1016\/0020-0190(93)90134-U_BIB2","series-title":"Thesis","article-title":"Practical translators for LR(k) languages","author":"DeRemer","year":"1969"},{"key":"10.1016\/0020-0190(93)90134-U_BIB3","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/362619.362625","article-title":"Simple LR(k) grammars","volume":"14","author":"DeRemer","year":"1971","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(93)90134-U_BIB4","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0304-3975(81)90067-0","article-title":"A parsing automata approach to LR theory","volume":"15","author":"Heilbrunner","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(93)90134-U_BIB5","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1016\/S0019-9958(65)90426-2","article-title":"On the translation of languages from left to right","volume":"8","author":"Knuth","year":"1965","journal-title":"Inform. and Control"},{"key":"10.1016\/0020-0190(93)90134-U_BIB6","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0020-0190(91)90152-8","article-title":"SLR(k) covering for LR(k) grammars","volume":"37","author":"Lee","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(93)90134-U_BIB7","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF00290336","article-title":"A practical general method for constructing LR(k) parsers","volume":"7","author":"Pager","year":"1977","journal-title":"Acta Inform."},{"key":"10.1016\/0020-0190(93)90134-U_BIB8","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1145\/2363.2527","article-title":"A new analysis of LALR formalisms","volume":"7","author":"Park","year":"1985","journal-title":"ACM Trans. Programming Language Systems"},{"key":"10.1016\/0020-0190(93)90134-U_BIB9","series-title":"Tech. Rept. No. CS-TR-92-70","article-title":"On the Reduction of LR(k) Parsers","author":"Park","year":"1992"},{"key":"10.1016\/0020-0190(93)90134-U_BIB10","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","article-title":"A lattice theoretical fixed-point theorem and its applications","volume":"5","author":"Tarski","year":"1955","journal-title":"Pacific J. Math."},{"key":"10.1016\/0020-0190(93)90134-U_BIB11","series-title":"Discrete Mathematical Structures with Applications to Computer Science","author":"Tremblay","year":"1975"},{"key":"10.1016\/0020-0190(93)90134-U_BIB12","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1109\/TSE.1981.230837","article-title":"LR \u2013 automatic parser generator and LR(1) parser","volume":"7","author":"Wetherell","year":"1981","journal-title":"IEEE Trans. Software Engineering"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390134U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390134U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:21:54Z","timestamp":1555132914000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390134U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,10]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1993,10]]}},"alternative-id":["002001909390134U"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90134-u","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,10]]}}}