{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T22:59:35Z","timestamp":1765666775809},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540774419"},{"type":"electronic","value":"9783540774426"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77442-6_12","type":"book-chapter","created":{"date-parts":[[2007,12,19]],"date-time":"2007-12-19T04:35:03Z","timestamp":1198038903000},"page":"167-181","source":"Crossref","is-referenced-by-count":20,"title":["Parser Combinators for Ambiguous Left-Recursive Grammars"],"prefix":"10.1007","author":[{"given":"Richard A.","family":"Frost","sequence":"first","affiliation":[]},{"given":"Rahmatullah","family":"Hafiz","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Callaghan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","volume-title":"The Theory of Parsing, Translation, and Compiling, vol. I: Parsing","author":"A.V. Aho","year":"1972","unstructured":"Aho, A.V., Ullman, J.D.: The Theory of Parsing, Translation, and Compiling, vol. I: Parsing. Prentice-Hall, Englewood Cliffs (1972)"},{"key":"12_CR2","volume-title":"Recursive Programming Techniques","author":"W.H. Burge","year":"1975","unstructured":"Burge, W.H.: Recursive Programming Techniques. Addison-Wesley, Reading (1975)"},{"key":"12_CR3","unstructured":"Carroll, J.: Efficiency in large-scale parsing systems \u2013 parser comparison (2003), http:\/\/informatics.sussex.ac.uk\/research\/nlp\/carroll\/elsps.html"},{"issue":"2","key":"12_CR4","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1145\/362007.362035","volume":"13","author":"J. Earley","year":"1970","unstructured":"Earley, J.: An efficient context-free parsing algorithm. Communications of the ACM\u00a013(2), 94\u2013102 (1970)","journal-title":"Communications of the ACM"},{"key":"12_CR5","unstructured":"Fairburn, J.: Making form follow function: An exercise in functional programming style. Cambridge Comp. Lab. Technical Report No. 89 (1986)"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Ford, B.: Packrat parsing: Simple, powerful, lazy, linear time. In: ICFP, pp. 36\u201347 (2002)","DOI":"10.1145\/583852.581483"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Frost, R.A.: Realization of natural language interfaces using lazy functional programming. ACM Comp. Surv.\u00a038(4) Article 11 (2006)","DOI":"10.1145\/1177352.1177353"},{"issue":"4","key":"12_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/181761.181764","volume":"29","author":"R.A. Frost","year":"1994","unstructured":"Frost, R.A.: Using memoization to achieve polynomial complexity of purely functional executable specifications of non-deterministic top-down parsers. SIGPLAN Notices\u00a029(4), 23\u201330 (1994)","journal-title":"SIGPLAN Notices"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Frost, R.A., Hafiz, R., Callaghan.: Modular and efficient top-down parsing for ambiguous left-recursive grammars. In: Proc. of the Tenth Int. Conf. on Parsing Technologies, pp. 109\u2013120. ACL Press (2007)","DOI":"10.3115\/1621410.1621425"},{"issue":"5","key":"12_CR10","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/1149982.1149988","volume":"42","author":"R.A. Frost","year":"2006","unstructured":"Frost, R.A., Hafiz, R.: A new top-down parsing algorithm to accommodate ambiguity and left recursion in polynomial time. SIGPLAN Notices\u00a042(5), 46\u201354 (2006)","journal-title":"SIGPLAN Notices"},{"issue":"4","key":"12_CR11","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1017\/S0956796898003050","volume":"8","author":"G. Hutton","year":"1995","unstructured":"Hutton, G., Meijer, E.: Monadic parser combinators. J. of Functional Programming\u00a08(4), 437\u2013444 (1995)","journal-title":"J. of Functional Programming"},{"issue":"3","key":"12_CR12","first-page":"405","volume":"21","author":"M. Johnson","year":"1995","unstructured":"Johnson, M.: Squibs and discussions: Memoization in top-down parsing. Computational Linguistics\u00a021(3), 405\u2013417 (1995)","journal-title":"Computational Linguistics"},{"issue":"11","key":"12_CR13","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1145\/365876.365915","volume":"9","author":"S. Kuno","year":"1966","unstructured":"Kuno, S.: The augmented predictive analyzer for context-free languages \u2014 its relative efficiency. Communications of the ACM\u00a09(11), 810\u2013823 (1966)","journal-title":"Communications of the ACM"},{"key":"12_CR14","unstructured":"Lickman, P.: Parsing With Fixed Points. Master\u2019s Th., Oxford (1995)"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Nederhof, M.J., Koster, C.H.A.: Top-down parsing for left-recursive grammars. Technical Report 93\u201310. Research Institute for Declarative Systems, Department of Informatics, Faculty of Mathematics and Informatics, Katholieke Universiteit, Nijmegen (1993)","DOI":"10.1007\/3-540-57186-8_74"},{"issue":"1","key":"12_CR16","first-page":"91","volume":"17","author":"P. Norvig","year":"1991","unstructured":"Norvig, P.: Techniques for automatic memoization with applications to context-free parsing. Computational Linguistics\u00a017(1), 91\u201398 (1991)","journal-title":"Computational Linguistics"},{"key":"12_CR17","unstructured":"Shiel, B.A.: Observations on context-free parsing. Technical Reports TR 12\u201376, Center for Research in Computing Technology, Aiken Computational Laboratory, Harvard University (1976)"},{"key":"12_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-1885-0","volume-title":"Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems","author":"M. Tomita","year":"1986","unstructured":"Tomita, M.: Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems. Kluwer Academic Publishers, Boston, MA (1986)"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/3-540-15975-4_33","volume-title":"Functional Programming Languages and Computer Architecture","author":"P. Wadler","year":"1985","unstructured":"Wadler, P.: How to replace failure by a list of successes. In: Jouannaud, J.-P. (ed.) Functional Programming Languages and Computer Architecture. LNCS, vol.\u00a0201, pp. 113\u2013128. Springer, Heidelberg (1985)"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77442-6_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:12:11Z","timestamp":1619521931000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77442-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540774419","9783540774426"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77442-6_12","relation":{},"subject":[]}}