Total parser combinators

DOI10.1145/1863543.1863585MaRDI QIDQ5176948zbMATH OpenOpenAlexFDO

Authors Nils Anders Danielsson

Publication date 5 March 2015

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

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

zbMATH Keywords

dependent typesmixed induction and coinductionparser combinatorsproductivitytermination

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42)

Recommendations

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

Cited in

(13)

• Simple, functional, sound and complete parsing for all context-free grammars
• A mechanisation of some context-free language theory in HOL4
• Monadic parsing in Haskell
• Certified CYK parsing of context-free languages
• FUNCTIONAL PEARL Parallel Parsing Processes
• Combinator Parsers: From Toys to Tools
• A type- and scope-safe universe of syntaxes with binding: their semantics and proofs
• Combinator Parsing: A Short Tutorial
• When maybe is not good enough
• Finally tagless observable recursion for an abstract grammar model
• Verified decision procedures for MSO on words based on derivatives of regular expressions
• Combinators for parsing expressions
• A verified earley parser

Describes a project that uses

Uses Software

• TRX
• Agda

This page was built for publication: Total parser combinators

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