Combinators for parsing expressions

DOI10.1017/S0956796800001799zbMATH Open0860.68064MaRDI QIDQ5687909FDOQ5687909

Authors: Steve Hill 

Publication date: 16 December 1996

Published in: Journal of Functional Programming (Search for Journal in Brave)

Recommendations

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

zbMATH Keywords

parsers

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Cites Work

• Higher-order functions for parsing
• Yacc in sasl — an exercise in functional programming

Cited In (9)

• THEORETICAL PEARLS
• Managing and using mixed computations for the systematic construction of language-oriented parsers
• Combinator Parsing: A Short Tutorial
• Functional-Logic Graph Parser Combinators
• The semantics of parsing with semantic actions
• Predictive parser combinators need four values to report errors
• Simplified parsing expression derivatives
• Combinator Parsers: From Toys to Tools
• Total parser combinators

This page was built for publication: Combinators for parsing expressions

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