Parallel Parsing Processes

Authors:
Koen Claessen
Affiliations:
Department of Computing Science, Chalmers University of Technology, Gothenburg, Sweden (email: koen@cs.chalmers.se)
Venue:
Journal of Functional Programming
Year:
2004

Citing 6
Cited 11

Monad transformers and modular interpreters

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Generalising monads to arrows

Science of Computer Programming - Special issue on mathematics of program construction
Functional Parsers

Advanced Functional Programming, First International Spring School on Advanced Functional Programming Techniques-Tutorial Text
The Design of a Pretty-printing Library

Advanced Functional Programming, First International Spring School on Advanced Functional Programming Techniques-Tutorial Text
Deterministic, Error-Correcting Combinator Parsers

Advanced Functional Programming, Second International School-Tutorial Text
Monadic parsing in Haskell

Journal of Functional Programming

Sexy types in action

ACM SIGPLAN Notices
Programming monads operationally with Unimo

Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
A history of Haskell: being lazy with class

Proceedings of the third ACM SIGPLAN conference on History of programming languages
Generic programming in 3D

Science of Computer Programming
Lazy functional incremental parsing

Proceedings of the 2nd ACM SIGPLAN symposium on Haskell
Total parser combinators

Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Monatron: an extensible monad transformer library

IFL'08 Proceedings of the 20th international conference on Implementation and application of functional languages
Purely functional lazy nondeterministic programming

Journal of Functional Programming - Dedicated to ICFP 2009
Iteratees

FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
Kan extensions for program optimisation or: art and dan explain an old trick

MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
Efficient divide-and-conquer parsing of practical context-free languages

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We derive a combinator library for non-deterministic parsers with a monadic interface, by means of successive refinements starting from a specification. The choice operator of the parser implements a breadth-first search rather than the more common depth-first search, and can be seen as a parallel composition between two parsing processes. The resulting library is simple and efficient for “almost deterministic” grammars, which are typical for programming languages and other computing science applications.