{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,19]],"date-time":"2024-04-19T23:56:43Z","timestamp":1713571003602},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1985,12,1]],"date-time":"1985-12-01T00:00:00Z","timestamp":502243200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1985,12,1]],"date-time":"1985-12-01T00:00:00Z","timestamp":502243200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1985,12]]},"DOI":"10.1007\/bf00267043","type":"journal-article","created":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T16:36:45Z","timestamp":1688488605000},"page":"499-536","source":"Crossref","is-referenced-by-count":2,"title":["Truly prefix-correct chain-free LR(1) parsers"],"prefix":"10.1007","volume":"22","author":[{"given":"S.","family":"Heilbrunner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF00267043_CR1","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1007\/BF00571461","volume":"2","author":"T. Anderson","year":"1973","unstructured":"Anderson, T., Eve, J., Horning, J.J.: Efficient LR(1) parsers. Acta Inf. 2, 12\u201339 (1973)","journal-title":"Acta Inf."},{"key":"BF00267043_CR2","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF00289049","volume":"9","author":"P. Deussen","year":"1978","unstructured":"Deussen, P.: A unified approach to the generation and acception of formal languages. Acta Inf. 9, 377\u2013390 (1978)","journal-title":"Acta Inf."},{"key":"BF00267043_CR3","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0304-3975(81)90067-0","volume":"15","author":"S. Heilbrunner","year":"1981","unstructured":"Heilbrunner, S.: A Parsing Automata Approach to LR Theory. Theor. Comput. Sci. 15, 117\u2013157 (1981)","journal-title":"Theor. Comput. Sci."},{"key":"BF00267043_CR4","unstructured":"Heilbrunner, S.: Practical conditions for correct elimination of chain productions from LR parsers. Hochschule der Bundeswehr M\u00fcnchen, Fachbereich Informatik, Bericht Nr. 8307, September 1983"},{"key":"BF00267043_CR5","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF00290336","volume":"7","author":"D. Pager","year":"1977","unstructured":"Pager, D.: A practical general method for constructing LR(k) parsers. Acta Inf. 7, 249\u2013268 (1977)","journal-title":"Acta Inf."},{"key":"BF00267043_CR6","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF00263764","volume":"9","author":"D. Pager","year":"1977","unstructured":"Pager, D.: Eliminating unit productions from LR parsers. Acta Inf. 9, 31\u201359 (1977)","journal-title":"Acta Inf."},{"key":"BF00267043_CR7","unstructured":"Rushby, J.M.: LR(k) sparse parsers and their optimization. University of Newcastle upon Tyne, Ph. D. Thesis 1977"},{"key":"BF00267043_CR8","unstructured":"Schmitz, L.: Theorie kettenfreier LR-Zerteiler. Hochschule der Bundeswehr M\u00fcnchen, Fachbereich Informatik, Dissertation, 1982"},{"key":"BF00267043_CR9","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1080\/00207168408803404","volume":"15","author":"L. Schmitz","year":"1984","unstructured":"Schmitz, L.: On the correct elimination of chain productions from LR parsers. Int. J. Comput. Math. 15, 2 (1984)","journal-title":"Int. J. Comput. Math."},{"key":"BF00267043_CR10","doi-asserted-by":"crossref","unstructured":"Soisalon-Soininen, E.: Elimination of single productions from LR parsers in conjunction with the use of default reductions. Conf. Record of the Fourth ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 183\u2013193 (1977)","DOI":"10.1145\/512950.512967"},{"key":"BF00267043_CR11","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1145\/357162.357165","volume":"4","author":"E. Soisalon-Soininen","year":"1982","unstructured":"Soisalon-Soininen, E.: Inessential error items and their use in LR parser optimization. ACM Trans. Program Lang. Syst. 4, 179\u2013195 (1982)","journal-title":"ACM Trans. Program Lang. Syst."},{"key":"BF00267043_CR12","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/BF00264538","volume":"15","author":"T. Tokuda","year":"1981","unstructured":"Tokuda, T.: Eliminating Unit Reductions from LR(k) Parsers using Minimum Contexts. Acta Inf. 15, 447\u2013470 (1981)","journal-title":"Acta Inf."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00267043.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/BF00267043\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00267043.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T16:36:55Z","timestamp":1688488615000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BF00267043"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,12]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1985,12]]}},"alternative-id":["BF00267043"],"URL":"https:\/\/doi.org\/10.1007\/bf00267043","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,12]]}}}