{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T14:08:03Z","timestamp":1648994883883},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1986,7,1]],"date-time":"1986-07-01T00:00:00Z","timestamp":520560000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1986,7]]},"DOI":"10.1007\/bf00267864","type":"journal-article","created":{"date-parts":[[2004,10,2]],"date-time":"2004-10-02T22:58:32Z","timestamp":1096757912000},"page":"361-392","source":"Crossref","is-referenced-by-count":0,"title":["Precedence technique is not worse than SLR(1)"],"prefix":"10.1007","volume":"23","author":[{"given":"Piotr","family":"Wyrostek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"The theory of parsing, translation and compiling, Vol. I, II","author":"A.V. Aho","year":"1972","unstructured":"Aho, A.V., Ullman, J.D.: The theory of parsing, translation and compiling, Vol. I, II. Englewood Cliffs, N.J.: Prentice Hall 1972, 1973"},{"key":"CR2","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?39 (1973)","journal-title":"Acta Inf."},{"key":"CR3","volume-title":"M.Sc. Thesis","author":"M. Brzozowska","year":"1979","unstructured":"Brzozowska, M., Kunert, L.: A language for simulation of logic circuits. The Jagiellonian University, M.Sc. Thesis, Krak\u00f3w 1979"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1145\/1780.1802","volume":"6","author":"P. Dencker","year":"1984","unstructured":"Dencker, P., D\u00fcrre, K., Heuft, J.: Optimization of parser tables for portable compilers. ACM Toplas 6, 546?572 (1984)","journal-title":"ACM Toplas"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/362619.362625","volume":"14","author":"F.L. DeRemer","year":"1971","unstructured":"DeRemer, F.L.: Simple LR(k) grammars. Commun ACM 14, 453?460 (1971)","journal-title":"Commun ACM"},{"key":"CR6","volume-title":"Ph.D. Thesis","author":"F.L. DeRemer","year":"1969","unstructured":"DeRemer, F.L.: Practical translators for LR(k) languages. MIT, Cambridge, Ph.D. Thesis, 1969"},{"key":"CR7","series-title":"Lect. Notes Comput. Sci.","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/3-540-06841-4_63","volume-title":"Automata, languages and programming, 2nd Colloquium","author":"M.M. Geller","year":"1974","unstructured":"Geller, M.M., Graham, S.L., Harrison, M.A.: Production prefix parsing. In: Automata, languages and programming, 2nd Colloquium, Lect. Notes Comput. Sci. 14, pp. 232?242. Berlin, Heidelberg, New York: Springer 1974"},{"key":"CR8","volume-title":"Ph.D. Thesis","author":"S.L. Graham","year":"1971","unstructured":"Graham, S.L.: Precedence languages and bounded right context languages. Stanford Univ., Stanford, Calif., Ph.D. Thesis, 1971"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1137\/0203019","volume":"3","author":"S.L. Graham","year":"1974","unstructured":"Graham, S.L.: On bounded right context languages and grammars. SIAM J. Comput. 3, 224?254 (1974)","journal-title":"SIAM J. Comput."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1145\/361219.361223","volume":"18","author":"S.L. Graham","year":"1975","unstructured":"Graham, S.L., Rhodes, S.P.: Practical syntactic error recovery. Commun ACM 18, 639?650 (1975)","journal-title":"Commun ACM"},{"key":"CR11","volume-title":"Introduction to Formal Language Theory","author":"M.A. Harrison","year":"1978","unstructured":"Harrison, M.A.: Introduction to Formal Language Theory. Reading, Mass.: Addison-Wesley 1978"},{"key":"CR12","series-title":"Lect. Notes Comput. Sci.","volume-title":"Pascal user manual and report","author":"K. Jensen","year":"1976","unstructured":"Jensen, K., Wirth, N.: Pascal user manual and report. Lect. Notes Comput. Sci. 18. Berlin, Heidelberg, New York: Springer 1976"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1016\/S0019-9958(65)90426-2","volume":"8","author":"D.E. Knuth","year":"1965","unstructured":"Knuth, D.E.: On the translation of languages from left to right. Inf Control 8, 607?639 (1965)","journal-title":"Inf Control"},{"key":"CR14","first-page":"93","volume":"10","author":"J. Kr\u00f3l","year":"1980","unstructured":"Kr\u00f3l, J., Wyrostek, P.: Some error recovery method for precedence parsers (in Polish). Podstawy Sterowania 10, 93?108 (1980)","journal-title":"Podstawy Sterowania"},{"key":"CR15","first-page":"153","volume-title":"Proc. IFIP Congress 1971, Ljubliana","author":"W.R. Lalonde","year":"1971","unstructured":"Lalonde, W.R., Lee, E.S., Horning, J.J.: An LALR(k) parser generator. Proc. IFIP Congress 1971, Ljubliana, pp. 153?157. Amsterdam: North-Holland 1971"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1093\/comjnl\/13.2.142","volume":"13","author":"A. Learner","year":"1970","unstructured":"Learner, A., Lim, A.L.: A note on transforming context-free grammars to Wirth-Weber precedence form. Comput. J. 13, 142?144 (1970)","journal-title":"Comput. J."},{"key":"CR17","unstructured":"Levy, J.P.: Automatic correction of syntax errors in programming languages. Cornell Univ., Ph.D. Thesis, TR71-116, 1971"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1145\/321707.321708","volume":"19","author":"J. McAfee","year":"1972","unstructured":"McAfee, J., Presser, L.: An algorithm for the design of simple precedence grammars. J. ACM 19, 385?395 (1972)","journal-title":"J. ACM"},{"key":"CR19","volume-title":"A compiler generator","author":"W.M. McKeeman","year":"1970","unstructured":"McKeeman, W.M., Horning, J.J., Wortman, D.B.: A compiler generator. Englewood Cliffs. N.J.: Prentice Hall 1970"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1145\/321958.321972","volume":"23","author":"D.M. Mickunas","year":"1976","unstructured":"Mickunas, D.M., Lancaster, R.L., Schneider, V.B.: Transforming LR(k) grammars to LR(1), SLR(1), and (1, 1) bounded right context grammars. J. ACM 23, 511?533 (1976)","journal-title":"J. ACM"},{"key":"CR21","first-page":"317","volume":"14","author":"K.R. Moll","year":"1980","unstructured":"Moll, K.R.: Left context precedence grammars. Acta Inf. 14, 317?335 (1980)","journal-title":"Acta Inf."},{"key":"CR22","unstructured":"Rhodes, S.P.: Practical syntactic error recovery for programming languages. Univ. of California, Ph.D. Thesis, 1973"},{"key":"CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-6328-9","volume-title":"Report on the programming language PLZ\/SYS","author":"T. Snock","year":"1978","unstructured":"Snock, T., Bass, C., Roberts, J., Nahapetian, A., Fay, M.: Report on the programming language PLZ\/SYS. Berlin, Heidelberg, New York: Springer 1978"},{"key":"CR24","first-page":"11","volume":"9","author":"N. Wirth","year":"1966","unstructured":"Wirth, N., Weber, H.: Euler ? a generalization of Algol and its formal definition. Commun ACM 9, 11?23, 89?99 (1966)","journal-title":"Commun ACM"},{"key":"CR25","volume-title":"Construction and optimization of LR(k) parsers (in Polish)","author":"J. Witaszek","year":"1979","unstructured":"Witaszek, J.: Construction and optimization of LR(k) parsers (in Polish). Prace Naukowo-Badawcze IMM, Warszawa 1979"},{"key":"CR26","unstructured":"Wyrostek, P.: Another view on the correct prefix property in precedence parsers. The Jagiellonian University, Dept. of Comp. Sci., Report 6, 1982"},{"key":"CR27","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0020-0190(83)90057-1","volume":"17","author":"P. Wyrostek","year":"1983","unstructured":"Wyrostek, P.: On the correct prefix property in precedence parsers. Inf. Process. Lett. 17, 161?165 (1983)","journal-title":"Inf. Process. Lett."},{"key":"CR28","unstructured":"Wyrostek, P.: SLR(1), LALR(1) and the most common grammar transformations. (In preparation)"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00267864.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00267864\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00267864","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T15:21:02Z","timestamp":1554304862000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00267864"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,7]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1986,7]]}},"alternative-id":["BF00267864"],"URL":"https:\/\/doi.org\/10.1007\/bf00267864","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,7]]}}}