{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T20:29:31Z","timestamp":1672691371059},"reference-count":7,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1986,11,1]],"date-time":"1986-11-01T00:00:00Z","timestamp":531187200000},"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":[[1986,11]]},"DOI":"10.1016\/0020-0190(86)90092-x","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"311-316","source":"Crossref","is-referenced-by-count":3,"title":["Efficient computation of the locally least-cost insertion string for the LR error repair"],"prefix":"10.1016","volume":"23","author":[{"given":"Kwang-Moo","family":"Choe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chun-Hyon","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(86)90092-X_BIB1","series-title":"Principles of Compiler Design","author":"Aho","year":"1977"},{"key":"10.1016\/0020-0190(86)90092-X_BIB2","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF00263195","article-title":"An alternative implementation of an insertion-only recovery technique","volume":"18","author":"Anderson","year":"1982","journal-title":"Acta Informatica"},{"issue":"1","key":"10.1016\/0020-0190(86)90092-X_BIB3","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1093\/comjnl\/26.1.15","article-title":"An assessment of locally least-cost error recovery","volume":"26","author":"Anderson","year":"1983","journal-title":"The Comput. J."},{"key":"10.1016\/0020-0190(86)90092-X_BIB4","article-title":"A new analysis of LALR formalisms","author":"Choe","year":"1983"},{"key":"10.1016\/0020-0190(86)90092-X_BIB5","article-title":"A locally least-cost LR-error corrector","author":"Fischer","year":"1979"},{"issue":"3","key":"10.1016\/0020-0190(86)90092-X_BIB6","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00263990","article-title":"Efficient LL(1) error correction and recovery using only insertions","volume":"13","author":"Fischer","year":"1980","journal-title":"Acta Informatica"},{"issue":"1","key":"10.1016\/0020-0190(86)90092-X_BIB7","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. Programm. Languages and Systems"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908690092X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908690092X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T00:20:29Z","timestamp":1584490829000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001908690092X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,11]]},"references-count":7,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1986,11]]}},"alternative-id":["002001908690092X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(86)90092-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1986,11]]}}}