{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T05:28:51Z","timestamp":1700026131909},"reference-count":18,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,10,1]],"date-time":"1990-10-01T00:00:00Z","timestamp":654739200000},"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":8325,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1990,10]]},"DOI":"10.1016\/0022-0000(90)90037-l","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"230-250","source":"Crossref","is-referenced-by-count":22,"title":["Practical arbitrary lookahead LR parsing"],"prefix":"10.1016","volume":"41","author":[{"given":"Manuel E.","family":"Bermudez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karl M.","family":"Schimpf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"No. 1","key":"10.1016\/0022-0000(90)90037-L_BIB1","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1007\/BF00571461","article-title":"Efficient LR(1) parsers","volume":"2","author":"Anderson","year":"1973","journal-title":"Acta Inform."},{"issue":"No. 2","key":"10.1016\/0022-0000(90)90037-L_BIB2","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0022-0000(81)90030-1","article-title":"Extending lookahead for LR parsers","volume":"22","author":"Baker","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(90)90037-L_BIB3","article-title":"The LAL(m, NS, k) Parser Generator","author":"Baumann","year":"1987"},{"issue":"No. 7","key":"10.1016\/0022-0000(90)90037-L_BIB4","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1145\/13310.13325","article-title":"A practical arbitrary lookahead LR parsing technique","volume":"21","author":"Bermudez","year":"1986","journal-title":"SIGPLAN Notices"},{"key":"10.1016\/0022-0000(90)90037-L_BIB5","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/S0022-0000(73)80050-9","article-title":"LR-regular grammars\u2014An extension of LR(k) grammars","volume":"7","author":"C\u0306ulik","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(90)90037-L_BIB6","article-title":"Practical Translators for LR(k) Languages","author":"Deremer","year":"1969"},{"issue":"No. 7","key":"10.1016\/0022-0000(90)90037-L_BIB7","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"},{"issue":"No. 4","key":"10.1016\/0022-0000(90)90037-L_BIB8","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1145\/69622.357187","article-title":"Efficient computation of LALR(1) lookahead sets","volume":"4","author":"Deremer","year":"1982","journal-title":"ACM TOPLAS"},{"issue":"No. 9","key":"10.1016\/0022-0000(90)90037-L_BIB9","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1145\/954312.954315","article-title":"Ada syntax chart","volume":"16","author":"Deremer","year":"1981","journal-title":"SIGPLAN Notices"},{"key":"10.1016\/0022-0000(90)90037-L_BIB10","series-title":"An Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0022-0000(90)90037-L_BIB11","article-title":"YACC-Yet Another Compiler Compiler","volume":"32","author":"Johnson","year":"1974"},{"key":"10.1016\/0022-0000(90)90037-L_BIB12","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"},{"issue":"No. 11","key":"10.1016\/0022-0000(90)90037-L_BIB13","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1145\/363269.363281","article-title":"A practical method for constructing LR(k) processors","volume":"12","author":"Korenjak","year":"1969","journal-title":"Comm. ACM"},{"issue":"No. 1","key":"10.1016\/0022-0000(90)90037-L_BIB14","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1145\/357121.357126","article-title":"Methods for computing LALR(k) lookahead","volume":"3","author":"Kristensen","year":"1981","journal-title":"ACM TOPLAS"},{"key":"10.1016\/0022-0000(90)90037-L_BIB15","article-title":"An Efficient LALR Parser Generator","volume":"2","author":"Lalonde","year":"1971"},{"key":"10.1016\/0022-0000(90)90037-L_BIB16","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF00290336","article-title":"A practical general method for constructing LR(k) parsers","volume":"7","author":"Pager","year":"1977","journal-title":"Acta Inform."},{"issue":"No. 1","key":"10.1016\/0022-0000(90)90037-L_BIB17","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 TOPLAS"},{"issue":"No. 2","key":"10.1016\/0022-0000(90)90037-L_BIB18","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1145\/322374.322376","article-title":"The complexity of LALR(k) testing","volume":"30","author":"Sippu","year":"1983","journal-title":"J. Assoc. Comput. Mech."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009090037L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009090037L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:55:56Z","timestamp":1550325356000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009090037L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,10]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,10]]}},"alternative-id":["002200009090037L"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(90)90037-l","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1990,10]]}}}