{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T15:58:06Z","timestamp":1781884686441,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642409219","type":"print"},{"value":"9783642409226","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40922-6_1","type":"book-chapter","created":{"date-parts":[[2013,9,24]],"date-time":"2013-09-24T03:12:51Z","timestamp":1379992371000},"page":"1-15","source":"Crossref","is-referenced-by-count":3,"title":["Exception Handling for Error Reporting in Parsing Expression Grammars"],"prefix":"10.1007","author":[{"given":"Andr\u00e9 Murbach","family":"Maidl","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fabio","family":"Mascarenhas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Roberto","family":"Ierusalimschy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"1_CR1","volume-title":"Compilers: Principles, Techniques, and Tools","author":"A.V. Aho","year":"2006","unstructured":"Aho, A.V., Lam, M.S., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, and Tools, 2nd edn. Addison-Wesley Longman Publishing Co., Inc., Boston (2006)","edition":"2"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Ford, B.: Packrat parsing: a practical linear-time algorithm with backtracking. Master\u2019s thesis, Massachusetts Institute of Technology (September 2002)","DOI":"10.1145\/583852.581483"},{"key":"1_CR3","first-page":"36","volume-title":"ICFP 2002: Proceedings of the 7th ACM SIGPLAN International Conference on Functional Programming","author":"B. Ford","year":"2002","unstructured":"Ford, B.: Packrat Parsing: Simple, Powerful, Lazy, Linear Time. In: ICFP 2002: Proceedings of the 7th ACM SIGPLAN International Conference on Functional Programming, pp. 36\u201347. ACM, New York (2002)"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1145\/964001.964011","volume-title":"POPL 2004: Proceedings of the 31st ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages","author":"B. Ford","year":"2004","unstructured":"Ford, B.: Parsing Expression Grammars: A Recognition-Based Syntactic Foundation. In: POPL 2004: Proceedings of the 31st ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 111\u2013122. ACM, New York (2004)"},{"key":"1_CR5","unstructured":"Grune, D., Jacobs, C.J.: Parsing Techniques: A Practical Guide, 2nd edn. Springer Publishing Company, Incorporated (2010)"},{"issue":"3","key":"1_CR6","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1017\/S0956796800000411","volume":"2","author":"G. Hutton","year":"1992","unstructured":"Hutton, G.: Higher-Order Functions for Parsing. Journal of Functional Programming\u00a02(3), 323\u2013343 (1992)","journal-title":"Journal of Functional Programming"},{"key":"1_CR7","unstructured":"Ierusalimschy, R.: LPeg - Parsing Expression Grammars for Lua (2008), http:\/\/www.inf.puc-rio.br\/~roberto\/lpeg\/lpeg.html (visited on March 2013)"},{"issue":"3","key":"1_CR8","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/spe.892","volume":"39","author":"R. Ierusalimschy","year":"2009","unstructured":"Ierusalimschy, R.: A Text Pattern-Matching Tool based on Parsing Expression Grammars. Software - Practice & Experience\u00a039(3), 221\u2013258 (2009)","journal-title":"Software - Practice & Experience"},{"issue":"5","key":"1_CR9","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1145\/937563.937566","volume":"25","author":"C.L. Jeffery","year":"2003","unstructured":"Jeffery, C.L.: Generating LR Syntax Error Messages from Examples. ACM Transactions on Programming Languages and Systems\u00a025(5), 631\u2013640 (2003)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"1_CR10","unstructured":"Leijen, D., Meijer, E.: Parsec: Direct Style Monadic Parser Combinators For The Real World. Technical Report UU-CS-2001-35, Department of Computer Science, Utrecht University (2001)"},{"key":"1_CR11","unstructured":"Louden, K.C.: Compiler Construction: Principles and Practice. PWS Publishing Co., Boston (1997)"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Medeiros, S., Mascarenhas, F., Ierusalimschy, R.: From Regular Expressions to Parsing Expression Grammars. In: Brazilian Symposium on Programming Languages (2011)","DOI":"10.1007\/978-3-642-33182-4_4"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-33182-4_4","volume-title":"Programming Languages","author":"S. Medeiros","year":"2012","unstructured":"Medeiros, S., Mascarenhas, F., Ierusalimschy, R.: Left Recursion in Parsing Expression Grammars. In: de Carvalho Junior, F.H., Barbosa, L.S. (eds.) SBLP 2012. LNCS, vol.\u00a07554, pp. 27\u201341. Springer, Heidelberg (2012)"},{"key":"1_CR14","first-page":"29","volume-title":"PASTE 2010: Proceedings of the 9th ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering","author":"K. Mizushima","year":"2010","unstructured":"Mizushima, K., Maeda, A., Yamaguchi, Y.: Packrat Parsers Can Handle Practical Grammars in Mostly Constant Space. In: PASTE 2010: Proceedings of the 9th ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, pp. 29\u201336. ACM, New York (2010)"},{"issue":"2","key":"1_CR15","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1017\/S0956796800001714","volume":"6","author":"A. Partridge","year":"1996","unstructured":"Partridge, A., Wright, D.: Predictive parser combinators need four values to report errors. Journal of Functional Programming\u00a06(2), 355\u2013364 (1996)","journal-title":"Journal of Functional Programming"},{"key":"1_CR16","unstructured":"Piumarta, I.: Peg\/leg \u2014 recursive-descent parser generators for C (2007), http:\/\/piumarta.com\/software\/peg\/ (visited on March 2013)"},{"key":"1_CR17","unstructured":"R\u00f6jemo, N.: Efficient Parsing Combinators. Technical report, Department of Computer Science, Chalmers University of Technology (1995)"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/3-540-61628-4_7","volume-title":"Advanced Functional Programming","author":"S.D. Swierstra","year":"1996","unstructured":"Swierstra, S.D., Duponcheel, L.: Deterministic, Error-Correcting Combinator Parsers. In: Launchbury, J., Sheard, T., Meijer, E. (eds.) AFP 1996. LNCS, vol.\u00a01129, pp. 184\u2013207. Springer, Heidelberg (1996)"},{"key":"1_CR19","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3054.001.0001","volume-title":"The Formal Semantics of Programming Languages: An Introduction","author":"G. Winskel","year":"1993","unstructured":"Winskel, G.: The Formal Semantics of Programming Languages: An Introduction. MIT Press, Cambridge (1993)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40922-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,6]],"date-time":"2022-03-06T15:21:22Z","timestamp":1646580082000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40922-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642409219","9783642409226"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40922-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}