{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T22:39:55Z","timestamp":1649198395170},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1979,1,1]],"date-time":"1979-01-01T00:00:00Z","timestamp":283996800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":12616,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1979]]},"DOI":"10.1016\/0304-3975(79)90052-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"1-11","source":"Crossref","is-referenced-by-count":4,"title":["On the covering problem for left-recursive grammars"],"prefix":"10.1016","volume":"8","author":[{"given":"Eljas","family":"Soisalon-Soininen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(79)90052-5_BIB1","article-title":"The Theory of Parsing, Translation, and Compiling","volume":"Vol. 1","author":"Aho","year":"1972"},{"key":"10.1016\/0304-3975(79)90052-5_BIB2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1093\/comjnl\/11.1.31","article-title":"A syntax improving program","volume":"11","author":"Foster","year":"1968","journal-title":"Comput. J."},{"key":"10.1016\/0304-3975(79)90052-5_BIB3","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1145\/321724.321732","article-title":"On the covering and reduction problems for context-free grammars","volume":"19","author":"Gray","year":"1972","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(79)90052-5_BIB4","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1145\/365719.365984","article-title":"On top-to-bottom recognition and left recursion","volume":"9","author":"Kurki-Suonio","year":"1966","journal-title":"Commun. ACM"},{"key":"10.1016\/0304-3975(79)90052-5_BIB5","first-page":"86","article-title":"On the covering of left-recursive grammars","author":"Nijholt","year":"1977","journal-title":"Conference Record of the Fourth ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(79)90052-5_BIB6","series-title":"Report A-1977-3","article-title":"Characterization of LL (k) languages by restricted LR(k) grammars","author":"Soisalon-Soininen","year":"1977"},{"key":"10.1016\/0304-3975(79)90052-5_BIB7","series-title":"Automata, Languages and Programming, Third Colloquium","first-page":"10","article-title":"A characterization of LL (k) languages","author":"Soisalon-Soininen","year":"1976"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397579900525?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397579900525?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:23:14Z","timestamp":1555125794000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397579900525"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1979]]}},"alternative-id":["0304397579900525"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(79)90052-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1979]]}}}