{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:19Z","timestamp":1725663679536},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544449"},{"type":"electronic","value":"9783540383628"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54444-5_98","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:49:33Z","timestamp":1330210173000},"page":"183-194","source":"Crossref","is-referenced-by-count":2,"title":["Precedences in specifications and implementations of programming languages"],"prefix":"10.1007","author":[{"given":"Annika","family":"Aasa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"16_CR1","unstructured":"Annika Aasa. Recursive Descent Parsing of User Defined Distfix Operators. Licentiate Thesis, Dept. of Computer Sciences, Chalmers University of Technology, S-412 96 G\u00f6teborg, Sweden, May 1989."},{"key":"16_CR2","unstructured":"Annika Aasa. Conctypes with precedences. In preparation, Dept. of Computer Sciences, Chalmers University of Technology, S-412 96 G\u00f6teborg, Sweden, 1991."},{"issue":"8","key":"16_CR3","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1145\/360933.360969","volume":"18","author":"A. V. Aho","year":"1975","unstructured":"A. V. Aho, S. C. Johnson, and J. D. Ullman. Deterministic Parsing of Ambiguous Grammars. Communications of the ACM, 18(8):441\u2013452, August 1975.","journal-title":"Communications of the ACM"},{"key":"16_CR4","volume-title":"Compilers: Principles, Techniques, Tools","author":"A. V. Aho","year":"1986","unstructured":"A. V. Aho, J. D. Ullman, and R. Sethi. Compilers: Principles, Techniques, Tools. Addison-Wesley Publishing Company, Reading, Mass., 1986."},{"key":"16_CR5","unstructured":"Roland Backhouse. Syntax of Programming Languages, Theory and Practice. Prentice Hall, 1979."},{"key":"16_CR6","volume-title":"Recursive Programming Techniques","author":"W. H. Burge","year":"1975","unstructured":"W. H. Burge. Recursive Programming Techniques. Addison-Wesley Publishing Company, Reading, Mass., 1975."},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"R. M. Burstall, D. B. McQueen, and D. T. Sannella. Hope: An Experimental Applicative Language. In Proceedings of the 1980 ACM Symposium on Lisp and Functional Programming, pages 136\u2013143, Stanford, CA, August 1980.","DOI":"10.1145\/800087.802799"},{"key":"16_CR8","unstructured":"J. C. Cleaveland and R. C. Uzgalis. Grammars for Programming Languages. Elsevier North-Holland, 1977."},{"key":"16_CR9","unstructured":"A. J. T. Davie and R. Morrison. Recursive Descent Compiling. Ellice Horwood Limited, 1981."},{"issue":"2","key":"16_CR10","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1145\/362007.362035","volume":"13","author":"J. Earley","year":"1970","unstructured":"Jay Earley. An Efficient Context-Free Parsing Algorithm. Communications of the ACM, 13(2):94\u2013102, February 1970.","journal-title":"Communications of the ACM"},{"issue":"2","key":"16_CR11","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF00288747","volume":"4","author":"J. Earley","year":"1975","unstructured":"Jay Earley. Ambiguity and Precedence in Syntax Description. Acta Informatica, 4(2):183\u2013192, 1975.","journal-title":"Acta Informatica"},{"issue":"6","key":"16_CR12","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/spe.4380170603","volume":"17","author":"J. Fairbairn","year":"1987","unstructured":"Jon Fairbairn. Making Form Follow Function: An Exercise in Functional Programming Style. Software-Practice and Experience, 17(6):379\u2013386, 1987.","journal-title":"Software-Practice and Experience"},{"issue":"3","key":"16_CR13","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1145\/321172.321179","volume":"10","author":"R. W. Floyd","year":"1963","unstructured":"R. W. Floyd. Syntactic Analysis and Operator Precedence. Journal of the ACM, 10(3):316\u2013333, 1963.","journal-title":"Journal of the ACM"},{"issue":"12","key":"16_CR14","doi-asserted-by":"crossref","first-page":"1205","DOI":"10.1002\/spe.4380151206","volume":"15","author":"D. R. Hanson","year":"1985","unstructured":"David R. Hanson. Compact Recursive-descent Parsing of Expressions. Software-Practice and Experience, 15(12):1205\u20131212, 1985.","journal-title":"Software-Practice and Experience"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"J-P. Jouannaud K. Futatsugi, J. A. Goguen and J. Meseguer. Principles of OBJ2. In Proceedings of the 12:th ACM Symposium on Principles of Programming Languages, pages 52\u201366, 1985.","DOI":"10.1145\/318593.318610"},{"key":"16_CR16","unstructured":"R. Milner. Standard ML Proposal. Polymorphism: The ML\/LCF\/Hope Newsletter, 1(3), January 1984."},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Fernando C. N. Pereira and David H. D. Warren. Parsing as deduction. In Proceedings of the 21'st Annual Meeting of the Association for Computational Linguistics, pages 137\u2013144, 1983.","DOI":"10.3115\/981311.981338"},{"key":"16_CR18","unstructured":"Kent Petersson. LABORATION: Denotationsemantik i ML, 1985. Dept. of Computer Sciences, Univ. of G\u00f6teborg and Chalmers Univ. of Tech, S-412 96 G\u00f6teborg, Sweden."},{"key":"16_CR19","volume-title":"The Art of Prolog","author":"L. Sterling","year":"1986","unstructured":"Leon Sterling and Ehud Shapiro. The Art of Prolog. The MIT Press, Cambridge, Massachusetts, London, England, 1986."},{"key":"16_CR20","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF00268139","volume":"6","author":"R.M. Wharton","year":"1976","unstructured":"R.M. Wharton. Resolution of Ambiguity in Parsing. Acta Informatica, 6:387\u2013395, 1976.","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","Programming Language Implementation and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54444-5_98.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:54:43Z","timestamp":1605646483000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54444-5_98"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544449","9783540383628"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-54444-5_98","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}