{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:36:23Z","timestamp":1742938583286,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319202969"},{"type":"electronic","value":"9783319202976"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20297-6_5","type":"book-chapter","created":{"date-parts":[[2015,6,22]],"date-time":"2015-06-22T01:55:05Z","timestamp":1434938105000},"page":"67-79","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generalized LR Parsing for Grammars with Contexts"],"prefix":"10.1007","author":[{"given":"Mikhail","family":"Barash","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Okhotin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,23]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-642-20712-9_27","volume-title":"Computer Science \u2013 Theory and Applications","author":"T Aizikowitz","year":"2011","unstructured":"Aizikowitz, T., Kaminski, M.: LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata. In: Kulikov, A., Vereshchagin, N. (eds.) CSR 2011. LNCS, vol. 6651, pp. 345\u2013358. Springer, Heidelberg (2011)"},{"key":"5_CR2","unstructured":"Barash, M.: Programming language specification by a grammar with contexts. In: NCMA 2013, Ume\u00e5, Sweden, pp. 51\u201367, 13\u201314 August 2013"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1016\/j.ic.2014.03.003","volume":"237","author":"M Barash","year":"2014","unstructured":"Barash, M., Okhotin, A.: An extension of context-free grammars with one-sided context specifications. Inf. Comput. 237, 268\u2013293 (2014)","journal-title":"Inf. Comput."},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-1-4615-4034-2_4","volume-title":"Generalized LR Parsing","author":"JR Kipps","year":"1991","unstructured":"Kipps, J.R.: GLR parsing in time $${\\cal O}(n^3)$$. In: Tomita, M. (ed.) Generalized LR Parsing, pp. 43\u201359. Kluwer, Boston (1991)"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1016\/S0019-9958(65)90426-2","volume":"8","author":"DE Knuth","year":"1965","unstructured":"Knuth, D.E.: On the translation of languages from left to right. Inf. Control 8, 607\u2013639 (1965)","journal-title":"Inf. Control"},{"key":"5_CR6","volume-title":"Logic for Problem Solving","author":"R Kowalski","year":"1979","unstructured":"Kowalski, R.: Logic for Problem Solving. Elsevier, Amsterdam (1979)"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/3-540-06841-4_65","volume-title":"Automata, Languages and Programming","author":"B Lang","year":"1974","unstructured":"Lang, B.: Deterministic techniques for efficient non-deterministic parsers. In: Loeckx, J. (ed.) Automata, Languages and Programming. LNCS, vol. 14, pp. 255\u2013269. Springer, Heidelberg (1974)"},{"issue":"4","key":"5_CR8","first-page":"519","volume":"6","author":"A Okhotin","year":"2001","unstructured":"Okhotin, A.: Conjunctive grammars. J. Automata Lang. Comb. 6(4), 519\u2013535 (2001)","journal-title":"J. Automata Lang. Comb."},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1023\/A:1016329527130","volume":"5","author":"A Okhotin","year":"2002","unstructured":"Okhotin, A.: LR parsing for conjunctive grammars. Grammars 5, 81\u2013124 (2002)","journal-title":"Grammars"},{"issue":"3","key":"5_CR10","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1142\/S0129054106004029","volume":"17","author":"A Okhotin","year":"2006","unstructured":"Okhotin, A.: Generalized LR parsing algorithm for Boolean grammars. Int. J. Found. Comput. Sci. 17(3), 629\u2013664 (2006)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2013.06.001","volume":"9","author":"A Okhotin","year":"2013","unstructured":"Okhotin, A.: Conjunctive and Boolean grammars: the true general case of the context-free grammars. Comput. Sci. Rev. 9, 27\u201359 (2013)","journal-title":"Comput. Sci. Rev."},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-39310-5_20","volume-title":"Descriptional Complexity of Formal Systems","author":"A Okhotin","year":"2013","unstructured":"Okhotin, A.: Improved normal form for grammars with one-sided contexts. In: Jurgensen, H., Reis, R. (eds.) DCFS 2013. LNCS, vol. 8031, pp. 205\u2013216. Springer, Heidelberg (2013)"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Pereira, F.C.N., Warren, D.H.D.: Parsing as deduction. In: 21st Annual Meeting of the Association for Computational Linguistics, Cambridge, USA, pp. 137\u2013144, 15\u201317 June 1983","DOI":"10.3115\/981311.981338"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/978-3-319-06686-8_24","volume-title":"Computer Science - Theory and Applications","author":"M Rabkin","year":"2014","unstructured":"Rabkin, M.: Recognizing two-sided contexts in cubic time. In: Hirsch, E.A., Kuznetsov, S.O., Pin, J.\u00c9., Vereshchagin, N.K. (eds.) CSR 2014. LNCS, vol. 8476, pp. 314\u2013324. Springer, Heidelberg (2014)"},{"issue":"4","key":"5_CR15","first-page":"1","volume":"14","author":"WC Rounds","year":"1988","unstructured":"Rounds, W.C.: LFP: a logic for linguistic descriptions and an analysis of its complexity. Comput. Linguist. 14(4), 1\u20139 (1988)","journal-title":"Comput. Linguist."},{"key":"5_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-1885-0","volume-title":"Efficient Parsing for Natural Language","author":"M Tomita","year":"1986","unstructured":"Tomita, M.: Efficient Parsing for Natural Language. Kluwer, Boston (1986)"},{"issue":"1","key":"5_CR17","first-page":"31","volume":"13","author":"M Tomita","year":"1987","unstructured":"Tomita, M.: An efficient augmented context-free parsing algorithm. Comput. Linguist. 13(1), 31\u201346 (1987)","journal-title":"Comput. Linguist."}],"container-title":["Lecture Notes in Computer Science","Computer Science -- Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20297-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T18:25:31Z","timestamp":1674239131000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20297-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319202969","9783319202976"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20297-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"23 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}