{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T00:09:50Z","timestamp":1649203790666},"reference-count":31,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1982,10,1]],"date-time":"1982-10-01T00:00:00Z","timestamp":402278400000},"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":[[1982,10]]},"DOI":"10.1016\/0020-0190(82)90038-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"97-101","source":"Crossref","is-referenced-by-count":0,"title":["On the relationship between the LL(k) and LR(k) grammars"],"prefix":"10.1016","volume":"15","author":[{"given":"Anton","family":"Nijholt","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(82)90038-2_BIB1","volume":"Vols. I and II","author":"Aho","year":"1972-1973"},{"key":"10.1016\/0020-0190(82)90038-2_BIB2","series-title":"Syntax of Programming Languages: Theory and Practice","author":"Backhouse","year":"1979"},{"key":"10.1016\/0020-0190(82)90038-2_BIB3","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0304-3975(80)90029-8","article-title":"Two iteration theorems for the LL(k) languages","volume":"12","author":"Beatty","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(82)90038-2_BIB4","series-title":"Rept. CS-79-36","article-title":"On the relationship between the LL(1) and LR(1) grammars","author":"Beatty","year":"1979"},{"key":"10.1016\/0020-0190(82)90038-2_BIB5","series-title":"Rept. TR-3-74","article-title":"Deterministic translation grammars","author":"Brosgol","year":"1974"},{"key":"10.1016\/0020-0190(82)90038-2_BIB6","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\/0020-0190(82)90038-2_BIB7","first-page":"170","article-title":"Generalized left corner parsing","author":"Demers","year":"1977","journal-title":"Conf. Record of the 4th ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0020-0190(82)90038-2_BIB8","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(82)90038-2_BIB9","series-title":"Lect. Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/3-540-09118-1_13","article-title":"Transition diagrams and strict deterministic grammars","volume":"67","author":"Friede","year":"1979"},{"key":"10.1016\/0020-0190(82)90038-2_BIB10","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\/0020-0190(82)90038-2_BIB11","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 parsers","volume":"14","author":"Geller","year":"1977","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(82)90038-2_BIB12","first-page":"55","article-title":"Toute grammaire LL(k) est LR(k)","volume":"18","author":"Griffiths","year":"1974","journal-title":"RAIRO Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(82)90038-2_BIB13","series-title":"Rept. MAC TR-119","article-title":"A new grammatical transformation into deterministic top-down form","author":"Hammer","year":"1974"},{"key":"10.1016\/0020-0190(82)90038-2_BIB14","first-page":"266","article-title":"A new grammatical transformation into LL(k) form","author":"Hammer","year":"1974","journal-title":"Conf. Record of the 6th Ann. Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(82)90038-2_BIB15","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0020-0190(82)90038-2_BIB16","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. Assoc. Comput. Mach."},{"key":"10.1016\/0020-0190(82)90038-2_BIB17","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(82)90038-2_BIB18","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1145\/322047.322051","article-title":"Lower bounds and reductions between grammar problems","volume":"25","author":"Hunt","year":"1978","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0020-0190(82)90038-2_BIB19","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(82)90038-2_BIB20","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 Inform."},{"key":"10.1016\/0020-0190(82)90038-2_BIB21","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 DeRemer's recognizer","volume":"2","author":"Kral","year":"1973","journal-title":"Inform. Process Lett."},{"key":"10.1016\/0020-0190(82)90038-2_BIB22","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1145\/321466.321477","article-title":"Syntax-directed transduction","volume":"15","author":"Lewis","year":"1968","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0020-0190(82)90038-2_BIB23","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1145\/321752.321756","article-title":"A formalization of transition diagram systems","volume":"20","author":"Lomet","year":"1973","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0020-0190(82)90038-2_BIB24","series-title":"Ph.D. Thesis","article-title":"Syntactic equivalence of grammar classes","author":"Moura","year":"1980"},{"key":"10.1016\/0020-0190(82)90038-2_BIB25","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0304-3975(79)90032-X","article-title":"Simple chain grammars and languages","volume":"9","author":"nijholt","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(82)90038-2_BIB26","series-title":"Rept. CSTR 80-CS-25","article-title":"A framework for classes of grammars between the LL(k) and LR(k) grammars","author":"Nijholt","year":"1980"},{"key":"10.1016\/0020-0190(82)90038-2_BIB27","series-title":"Lect. Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/3-540-10856-4_77","article-title":"Parsing strategies: A concise survey","volume":"118","author":"Nijholt","year":"1981"},{"key":"10.1016\/0020-0190(82)90038-2_BIB28","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0304-3975(81)90073-6","article-title":"On LLP(k) grammars and languages","volume":"16","author":"Pittl","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(82)90038-2_BIB29","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/S0019-9958(70)90446-8","article-title":"Properties of deterministic top-down grammars","volume":"17","author":"Rosenkrantz","year":"1970","journal-title":"Inform. and Control"},{"key":"10.1016\/0020-0190(82)90038-2_BIB30","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/BF01744303","article-title":"On comparing LL(k) and LR(k) grammars","volume":"13","author":"Soisalon-Soininen","year":"1980","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0020-0190(82)90038-2_BIB31","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF00268320","article-title":"A method for transforming grammars into LL(k) form","volume":"12","author":"Soisalon-Soininen","year":"1979","journal-title":"Acta Inform."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019082900382?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019082900382?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:54:50Z","timestamp":1555088090000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019082900382"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,10]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,10]]}},"alternative-id":["0020019082900382"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(82)90038-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1982,10]]}}}