{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T15:09:16Z","timestamp":1648652956166},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1988,6,1]],"date-time":"1988-06-01T00:00:00Z","timestamp":581126400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Translat"],"published-print":{"date-parts":[[1988,6]]},"DOI":"10.1007\/bf02055235","type":"journal-article","created":{"date-parts":[[2005,8,13]],"date-time":"2005-08-13T21:57:04Z","timestamp":1123970224000},"page":"121-155","source":"Crossref","is-referenced-by-count":1,"title":["Left-associative grammar: The algebraic definitions"],"prefix":"10.1007","volume":"3","author":[{"given":"Roland","family":"Hausser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02055235_CR1","volume-title":"The Theory of Parsing, Translation, and Compiling. Vol.I: Parsing","author":"A. V. Aho","year":"1972","unstructured":"Aho, A. V., and J. D. Ullman. 1972.The Theory of Parsing, Translation, and Compiling. Vol.I: Parsing. Englewood Cliffs, New Jersey: Prentice Hall."},{"key":"BF02055235_CR2","volume-title":"Principles of Compiler Design","author":"A. V. Aho","year":"1979","unstructured":"Aho, A. V., and J. D. Ullman. 1979.Principles of Compiler Design. Reading, Massachusetts: Addison-Wesley."},{"key":"BF02055235_CR3","doi-asserted-by":"crossref","unstructured":"Alt, F.L. and I. Rhodes. 1961. Recognition of Clauses and Phrases in Machine Translation of Languages. Proceedings of the First International Conference on Machine Translation of Languages and Applied Language Analaysis.","DOI":"10.6028\/NBS.RPT.6895"},{"key":"BF02055235_CR4","doi-asserted-by":"crossref","unstructured":"Bar-Hillel, Y. 1953. A Quasi-arithmetical Notation for Syntactic Description.Language 29.","DOI":"10.2307\/410452"},{"key":"BF02055235_CR5","volume-title":"Computational Complexity and Natural Language","author":"G. E. Barton","year":"1987","unstructured":"Barton, G. E., R. C. Berwick, and E. S. Ristad. 1987.Computational Complexity and Natural Language. Cambridge, Massachusetts: MIT Press."},{"key":"BF02055235_CR6","volume-title":"The Grammatical Basis of Linguistic Performance: Language Use and Aquisition","author":"R. C. Berwick","year":"1984","unstructured":"Berwick, R. C., and A. S. Weinberg. 1984.The Grammatical Basis of Linguistic Performance: Language Use and Aquisition. Cambridge, Massachusetts: MIT Press."},{"issue":"2","key":"BF02055235_CR7","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1145\/362007.362035","volume":"13","author":"J. Earley","year":"1970","unstructured":"Earley, J. 1970. An Efficient Context-Free Parsing Algorithm.CACM 13(2):94\u2013102.","journal-title":"CACM"},{"key":"BF02055235_CR8","unstructured":"Hausser, R. 1985. Left-associative Grammar and the Parser NEWCAT. Technical Report IN-CSLI-85-5. Center for the Study of Language and Information, Stanford University."},{"key":"BF02055235_CR9","volume-title":"Lecture Notes in Computer Science","author":"R. Hausser","year":"1986","unstructured":"Hausser, R. 1986.NEWCAT: Parsing Natural Language Using Left-associative Grammar. Lecture Notes in Computer Science. Berlin: Springer-Verlag."},{"key":"BF02055235_CR10","volume-title":"Technical Report CMU-CMT-87-104","author":"R. Hausser","year":"1987","unstructured":"Hausser, R. 1987. Left-Associative Grammar: Theory and Implementation. Technical Report CMU-CMT-87-104. Center for Machine Translation, Carnegie Mellon University, Pittsburgh, PA."},{"key":"BF02055235_CR11","first-page":"23","volume-title":"Computers and Translation. 3","author":"R. Hausser","year":"1988","unstructured":"Hausser, R. 1988a. Left-Associative Grammar, an Informal Outline.Computers and Translation. 3:23\u201367. Dordrecht, The Netherlands: Kluwer Academic Publishers."},{"key":"BF02055235_CR12","volume-title":"The Computational Complexity of Left-Associative Grammar","author":"R. Hausser","year":"1988","unstructured":"Hausser, R. 1988b. The Computational Complexity of Left-Associative Grammar, Proceedings of the Second International Conference on Theoretical and Methodological Issues in Machine Translation, Carnegie Mellon University, Pittsburgh, PA. June 12\u201314, 1988."},{"key":"BF02055235_CR13","volume-title":"Computation of Language","author":"R. Hausser","year":"1988","unstructured":"Hausser, R. (forthcoming).Computation of Language. Berlin: Springer-Verlag. 1988."},{"key":"BF02055235_CR14","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. E. Hopcroft","year":"1979","unstructured":"Hopcroft, J. E., and Ullman, J. D. 1979.Introduction to Automata Theory, Languages, and Computation. Reading, Massachusetts: Addison-Wesley."},{"key":"BF02055235_CR15","first-page":"306","volume-title":"Information Processing-62","author":"S. Kuno","year":"1963","unstructured":"Kuno, S. and A. Oettinger. 1963. Multiple Path Syntactic Analyzer. In: C. M. Popplewell (ed).Information Processing-62, p. 306\u2013312. Amsterdam: North-Holland."},{"key":"BF02055235_CR16","doi-asserted-by":"crossref","unstructured":"Oettinger, A. G. 1961. Automatic Syntactic Analysis and the Pushdown Store. Proceedings of Symposia in Applied Mathematics. American Mathematical Society, 12.","DOI":"10.1090\/psapm\/012\/9975"},{"key":"BF02055235_CR17","doi-asserted-by":"crossref","unstructured":"Rhodes, I. 1959. A New Approach to the Mechanical Translation of Russian. NBS Report No. 6295.","DOI":"10.6028\/NBS.RPT.6295"},{"key":"BF02055235_CR18","doi-asserted-by":"crossref","unstructured":"Sherry, M. 1961. Comprehensive Report on Predictive Syntactic Analysis. Mathematical Linguistics and Automatic Translation, Report No. NSF-7, Section I, Harvard Computation Laboratory.","DOI":"10.21236\/AD0271178"},{"key":"BF02055235_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-1885-0","volume-title":"Efficient Parsing for Natural Languages","author":"M. Tomita","year":"1986","unstructured":"Tomita, M. 1986.Efficient Parsing for Natural Languages. Dordrecht, The Netherlands: Kluwer Academic Publishers."},{"issue":"10","key":"BF02055235_CR20","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1145\/355598.362773","volume":"3","author":"W. A. Woods","year":"1970","unstructured":"Woods, W. A. 1970. Transition Network Grammars for Natural Language Analysis.CACM 3(10):591\u2013606.","journal-title":"CACM"}],"container-title":["Computers and Translation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02055235.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02055235\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02055235","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T00:23:43Z","timestamp":1586391823000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02055235"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,6]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1988,6]]}},"alternative-id":["BF02055235"],"URL":"https:\/\/doi.org\/10.1007\/bf02055235","relation":{},"ISSN":["0884-0709","1573-0573"],"issn-type":[{"value":"0884-0709","type":"print"},{"value":"1573-0573","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,6]]}}}