Polish parsers, step by step

DOI10.1145/944705.944727MaRDI QIDQ5261279zbMATH OpenOpenAlexFDO

Authors R. John M. Hughes, S. Doaitse Swierstra

Publication date 2 July 2015

Published in Proceedings of the eighth ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/944705.944727

zbMATH Keywords

breadth-first searchPolish representationambiguous grammarsGLR parsingparser combinatorsonline results

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42)

Recommendations

• Combinator Parsers: From Toys to Tools
• FUNCTIONAL PEARL Parallel Parsing Processes
• Combinator Parsing: A Short Tutorial
• Higher-order functions for parsing
• Simple, functional, sound and complete parsing for all context-free grammars

Cited in

(5)

• Efficient parallel and incremental parsing of practical context-free languages
• FUNCTIONAL PEARL Parallel Parsing Processes
• When maybe is not good enough
• A principled approach to programming with nested types in Haskell
• scientific article; zbMATH DE number 5370236 (Why is no real title available?)

This page was built for publication: Polish parsers, step by step

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261279)