{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,14]],"date-time":"2024-12-14T05:22:57Z","timestamp":1734153777006,"version":"3.30.2"},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,5,1]],"date-time":"1994-05-01T00:00:00Z","timestamp":767750400000},"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":["Computer Languages"],"published-print":{"date-parts":[[1994,5]]},"DOI":"10.1016\/0096-0551(94)90016-7","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T19:04:53Z","timestamp":1060283093000},"page":"89-100","source":"Crossref","is-referenced-by-count":3,"title":["Grammar transformations for optimizing backtrack parsers"],"prefix":"10.1016","volume":"20","author":[{"given":"Janos J.","family":"Sarbo","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0096-0551(94)90016-7_BIB1","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0020-0190(85)90072-9","article-title":"Upper bounds on the size of LR(k) parsers","volume":"20","author":"Ukkonen","year":"1985","journal-title":"Information Processing Lett."},{"key":"10.1016\/0096-0551(94)90016-7_BIB2","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0096-0551(90)90021-G","article-title":"Incremental generation of LR parsers","volume":"14","author":"Horsepool","year":"1990","journal-title":"Comput. Lang."},{"key":"10.1016\/0096-0551(94)90016-7_BIB3","series-title":"Third International Workshop on Parsing Technologies (IWPT-93)","article-title":"Increasing the applicability of LR-parsing","author":"Nederhof","year":"1993"},{"article-title":"Computational Linguistics at Delft: A Status Report","year":"1990","author":"Schoorl","key":"10.1016\/0096-0551(94)90016-7_BIB4"},{"article-title":"Corpus Linguistics and the Automatic Analysis of English","year":"1991","author":"Oostdijk","key":"10.1016\/0096-0551(94)90016-7_BIB5"},{"year":"1977","series-title":"Vertalerbouw","author":"Alblas","key":"10.1016\/0096-0551(94)90016-7_BIB6"},{"year":"1972","author":"Aho","key":"10.1016\/0096-0551(94)90016-7_BIB7"},{"key":"10.1016\/0096-0551(94)90016-7_BIB8","article-title":"Top-Down Parsing for Left-Recursive Grammars","author":"Nederhof","year":"1993","journal-title":"Technical Report No. 93-10"},{"key":"10.1016\/0096-0551(94)90016-7_BIB9","series-title":"Statistical Methods in Linguistics","first-page":"71","article-title":"Observations on context-free parsing","author":"Sheil","year":"1976"},{"key":"10.1016\/0096-0551(94)90016-7_BIB10","series-title":"Proc. First Twente Workshop on Language Technology","article-title":"Recursive ascent parsing","author":"Leermakers","year":"1991"},{"key":"10.1016\/0096-0551(94)90016-7_BIB11","series-title":"Functional Programming Languages and Computer Architecture","article-title":"Lazy Memo-functions","author":"Hughes","year":"1985"},{"year":"1986","series-title":"Efficient Parsing for Natural Language","author":"Tomita","key":"10.1016\/0096-0551(94)90016-7_BIB12"},{"key":"10.1016\/0096-0551(94)90016-7_BIB13","series-title":"International Workshop on Parsing Technologies","first-page":"182","article-title":"Handling of ill-designed grammars in Tomita's parsing algorithm","author":"Nozohoor-Farshi","year":"1989"},{"key":"10.1016\/0096-0551(94)90016-7_BIB14","unstructured":"Koster C. H. A., Private communication. University of Nijmegen; 1992."},{"year":"1978","series-title":"Introduction to Formal Language theory","author":"Harrison","key":"10.1016\/0096-0551(94)90016-7_BIB15"},{"issue":"No. 2","key":"10.1016\/0096-0551(94)90016-7_BIB16","doi-asserted-by":"crossref","DOI":"10.1016\/0020-0190(75)90009-5","article-title":"LL-regular grammars","volume":"4","author":"Jarzabek","year":"1975","journal-title":"Information Processing Lett."},{"key":"10.1016\/0096-0551(94)90016-7_BIB17","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":"\u010culik","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0096-0551(94)90016-7_BIB18","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0304-3975(87)90082-X","article-title":"A YACC extension for LRR grammar parsing","volume":"52","author":"Seite","year":"1987","journal-title":"Theoretical Comput. Sci."},{"key":"10.1016\/0096-0551(94)90016-7_BIB19","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/BF01933232","article-title":"The size of LALR(1) parsers","volume":"14","author":"Purdom","year":"1974","journal-title":"BIT"},{"key":"10.1016\/0096-0551(94)90016-7_BIB20","unstructured":"Sarbo, J. J. Grammar Transformations for Optimizing Backtrack Parsers. Technical Report, No. 93-15, Nijmegen."}],"container-title":["Computer Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055194900167?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055194900167?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T03:26:43Z","timestamp":1552620403000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0096055194900167"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,5]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,5]]}},"alternative-id":["0096055194900167"],"URL":"https:\/\/doi.org\/10.1016\/0096-0551(94)90016-7","relation":{},"ISSN":["0096-0551"],"issn-type":[{"type":"print","value":"0096-0551"}],"subject":[],"published":{"date-parts":[[1994,5]]}}}