{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T05:00:27Z","timestamp":1648616427808},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1985,2,1]],"date-time":"1985-02-01T00:00:00Z","timestamp":476064000000},"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":[[1985,2]]},"DOI":"10.1016\/0020-0190(85)90072-9","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"99-103","source":"Crossref","is-referenced-by-count":2,"title":["Upper bounds on the size of LR(k) parsers"],"prefix":"10.1016","volume":"20","author":[{"given":"Esko","family":"Ukkonen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(85)90072-9_BIB1","volume":"Vol. I, II","author":"Aho","year":"1973"},{"key":"10.1016\/0020-0190(85)90072-9_BIB2","article-title":"An efficient context-free parsing algorithm","author":"Earley","year":"1968"},{"key":"10.1016\/0020-0190(85)90072-9_BIB3","series-title":"Automata, Languages and Programming","first-page":"563","article-title":"An estimation of the set of states of the minimal LR(0)-acceptor","author":"Kemp","year":"1972"},{"key":"10.1016\/0020-0190(85)90072-9_BIB4","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":"Information and Control"},{"key":"10.1016\/0020-0190(85)90072-9_BIB5","series-title":"Proc. 10th Internat. Symp. on Mathematical Foundations of Computer Science (Strbsk\u00e9 Pleso)","first-page":"442","article-title":"Negative results on the size of deterministic right parsers","author":"Pittl","year":"1981"},{"key":"10.1016\/0020-0190(85)90072-9_BIB6","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0022-0000(83)90010-7","article-title":"Lower bounds on the size of deterministic parsers","volume":"26","author":"Ukkonen","year":"1983","journal-title":"J. Comput. System Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019085900729?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019085900729?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T09:26:07Z","timestamp":1553592367000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019085900729"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,2]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,2]]}},"alternative-id":["0020019085900729"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(85)90072-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1985,2]]}}}