Parsing with derivatives

DOI10.1145/2034773.2034801zbMath1323.68138OpenAlexW2188521969MaRDI QIDQ5176976

Matthew Might, David Darais, Daniel Spiewak

Publication date: 5 March 2015

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

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

zbMATH Keywords

derivativeregular expressionsformal languagescontext-free grammarparsingparser combinator

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42)

Related Items (10)

A Computational Interpretation of Context-Free Expressions ⋮ Verified decision procedures for MSO on words based on derivatives of regular expressions ⋮ Unnamed Item ⋮ On the semantics of parsing actions ⋮ Unnamed Item ⋮ Partial Derivatives for Context-Free Languages ⋮ Context-free grammars with lookahead ⋮ Bidirectional grammars for machine-code decoding and encoding ⋮ Derivatives for Enhanced Regular Expressions ⋮ Annotated regular expressions and input-driven languages

This page was built for publication: Parsing with derivatives