{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T17:35:04Z","timestamp":1648748104339},"reference-count":26,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1979,10,1]],"date-time":"1979-10-01T00:00:00Z","timestamp":307584000000},"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":12343,"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,10]]},"DOI":"10.1016\/0304-3975(79)90032-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"287-309","source":"Crossref","is-referenced-by-count":2,"title":["Simple chain grammars and languages"],"prefix":"10.1016","volume":"9","author":[{"given":"Anton","family":"Nijholt","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(79)90032-X_BIB1_1","volume":"Vols. 1","author":"Aho","year":"1972"},{"key":"10.1016\/0304-3975(79)90032-X_BIB1_2","volume":"Vols. 2","author":"Aho","year":"1973"},{"key":"10.1016\/0304-3975(79)90032-X_BIB2","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1145\/366663.366704","article-title":"Design of a separable transition-diagram compiler","volume":"6","author":"Conway","year":"1963","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(79)90032-X_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\/0304-3975(79)90032-X_BIB4","series-title":"Automata, Languages and Programming","first-page":"232","article-title":"Production prefix parsing","volume":"14","author":"Geller","year":"1974"},{"key":"10.1016\/0304-3975(79)90032-X_BIB5_1","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0022-0000(77)80017-2","article-title":"Characteristic parsing: A framework for producing compact deterministic parser, I","volume":"14","author":"Geller","year":"1977","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(79)90032-X_BIB5_2","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1016\/S0022-0000(77)80018-4","article-title":"Characteristic parsing: A framework for producing compact deterministic parser, II","volume":"14","author":"Geller","year":"1977","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(79)90032-X_BIB6","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0304-3975(77)90013-5","article-title":"On LR(k) grammars and languages","volume":"4","author":"Geller","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(79)90032-X_BIB7","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0012-365X(76)80004-0","article-title":"Normal forms of deterministic grammars","volume":"16","author":"Geller","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(79)90032-X_BIB8","doi-asserted-by":"crossref","first-page":"385","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. ACM"},{"key":"10.1016\/0304-3975(79)90032-X_BIB9","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1145\/800119.803904","article-title":"A new grammatical transformation into LL(k) form","author":"Hammer","year":"1974","journal-title":"Conference Record of the Sixth Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(79)90032-X_BIB10","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0022-0000(73)80008-X","article-title":"Strict deterministic grammars","volume":"7","author":"Harrison","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(79)90032-X_BIB11","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1145\/321850.321851","article-title":"On the parsing of deterministic languages","volume":"21","author":"Harrison","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(79)90032-X_BIB12","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF00289517","article-title":"Top-down syntax analysis","volume":"1","author":"Knuth","year":"1971","journal-title":"Acta Informat."},{"key":"10.1016\/0304-3975(79)90032-X_BIB13","first-page":"34","article-title":"Simple deterministic languages","author":"Korenjak","year":"1966","journal-title":"IEEE Conference Record of the Seventh Annual Symposium on Switching and Automata Theory"},{"key":"10.1016\/0304-3975(79)90032-X_BIB14","series-title":"Research Rep. UVT 10-11\/74","article-title":"Bottom up versus top down syntax analysis revised","author":"Kr\u00e1l","year":"1974"},{"key":"10.1016\/0304-3975(79)90032-X_BIB15","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/0020-0190(73)90021-5","article-title":"A note on the number of states of the DeRemer's recognizer","volume":"2","author":"Kr\u00e1l","year":"1973","journal-title":"Information Processing Lett."},{"key":"10.1016\/0304-3975(79)90032-X_BIB16","series-title":"Automata, Languages and Programming","first-page":"214","article-title":"Automatic generation of multiple exit parsing subroutines","volume":"14","author":"Lomet","year":"1974"},{"key":"10.1016\/0304-3975(79)90032-X_BIB17","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0022-0000(77)80027-5","article-title":"On the covering of parsable grammars","volume":"15","author":"Nijholt","year":"1977","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(79)90032-X_BIB18","series-title":"Automata, Languages and Programming","first-page":"352","article-title":"Simple chain grammars","volume":"52","author":"Nijholt","year":"1977"},{"key":"10.1016\/0304-3975(79)90032-X_BIB19","series-title":"Mathematical Foundations of Computer Science","first-page":"420","article-title":"Cover results and normal forms","volume":"53","author":"Nijholt","year":"1977"},{"key":"10.1016\/0304-3975(79)90032-X_BIB20","series-title":"Automata, Languages and Programming","first-page":"330","article-title":"On the parsing and covering of simple chain grammars","volume":"62","author":"Nijholt","year":"1978"},{"key":"10.1016\/0304-3975(79)90032-X_BIB21","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0012-365X(79)90152-3","article-title":"A left part theorem for grammatical trees","volume":"25","author":"Nijholt","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(79)90032-X_BIB22","unstructured":"E. Soisalon-Soininen, Characterization of LL(k) languages by restricted LR(k) grammars, Ph.D. Thesis, Rep A-1977-3, Dept. of Comput. Sci., University of Helsinki."},{"key":"10.1016\/0304-3975(79)90032-X_BIB23_1","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1093\/comjnl\/12.4.349","article-title":"The theory of left factored languages","volume":"12","author":"Wood","year":"1969","journal-title":"Comput. J."},{"key":"10.1016\/0304-3975(79)90032-X_BIB23_2","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1093\/comjnl\/13.1.55","article-title":"The theory of left factored languages","volume":"13","author":"Wood","year":"1970","journal-title":"Comput. J."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439757990032X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439757990032X?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:59Z","timestamp":1555125839000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439757990032X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,10]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1979,10]]}},"alternative-id":["030439757990032X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(79)90032-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1979,10]]}}}