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.
Publisher
Cambridge University Press (CUP)
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Calculating Compilers for Concurrency;Proceedings of the ACM on Programming Languages;2023-08-30
2. Oregano: staging regular expressions with Moore Cayley fusion;Proceedings of the 15th ACM SIGPLAN International Haskell Symposium;2022-09-06
3. Faster coroutine pipelines: A reconstruction;Journal of Functional Programming;2020
4. Faster Coroutine Pipelines: A Reconstruction;Practical Aspects of Declarative Languages;2018-12-19
5. Faceted Secure Multi Execution;Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security;2018-01-15