Design patterns for parser combinators (functional pearl)
File(s)
Published version
Author(s)
Willis, Jamie
Wu, Nicolas
Type
Conference Paper
Abstract
Parser combinators are a popular and elegant approach for parsing in functional languages. The design and implementation of such libraries are well discussed, but having a well-designed library is only one-half of the story. In this paper we explore several reusable approaches to writing parsers in combinator style, focusing on easy to apply patterns to keep parsing code simple, separated, and maintainable.
Date Issued
2021-08-18
Date Acceptance
2021-06-23
Citation
Proceedings of the 14th ACM SIGPLAN International Symposium on Haskell, 2021, pp.71-84
ISBN
9781450386159
Publisher
ACM
Start Page
71
End Page
84
Journal / Book Title
Proceedings of the 14th ACM SIGPLAN International Symposium on Haskell
Copyright Statement
© 2021 Copyright held by the owner/author(s). This work is licenced under a Creative Commons Attribution 4.0 International Licence (https://creativecommons.org/licenses/by/4.0/)
License URL
Sponsor
Engineering & Physical Science Research Council (EPSRC)
Grant Number
EP/S028129/1
Source
ACM SIGPLAN Haskell Symposium 2021
Subjects
Science & Technology
Technology
Computer Science, Software Engineering
Computer Science
parser combinators
Publication Status
Published
Start Date
2021-08-26
Finish Date
2021-08-27
Coverage Spatial
Virtual
Date Publish Online
2021-08-18