Abstract
We describe the development of a couple of combinators which can be used to run applicative style parsers in an interleaved way. In the presentation we advocate a scheme for choosing identifier names which clearly shows the types of the values involved, and how to compose them into the desired result. We finish with describing how the combinators can be used to parse command line arguments and files containing options. © 2013 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Swierstra, D. S., & Dijkstra, A. (2013). Parse your options. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8106, pp. 234–249). Springer Verlag. https://doi.org/10.1007/978-3-642-40355-2_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
