Higher-order functions for parsing

DOI10.1017/S0956796800000411zbMath0817.68097OpenAlexW2166030873MaRDI QIDQ4764615

G. Hutton

Publication date: 4 May 1995

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

Full work available at URL: https://doi.org/10.1017/s0956796800000411

zbMATH Keywords

combinator parsing

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Related Items (10)

Specifying rewrite strategies for interactive exercises ⋮ Pattern matching for the masses using custom notations ⋮ Functional-Logic Graph Parser Combinators ⋮ Unnamed Item ⋮ Combinators for parsing expressions ⋮ On the incremental growth and shrinkage of LR goto-graphs ⋮ Predictive parser combinators need four values to report errors ⋮ Recognizing Strategies ⋮ Effect polymorphism in higher-order logic (proof pearl) ⋮ Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars

Uses Software

• Haskell

Cites Work

• The next 700 programming languages

This page was built for publication: Higher-order functions for parsing