Results 1 to 10 of about 80,039 (149)
Design patterns for parser combinators (functional pearl) [PDF]
Proceedings of the 14th ACM SIGPLAN International Symposium on Haskell, 2021 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.
Jamie Willis, Nicolas Wu
semanticscholar +4 more sources
Lightweight multi-language syntax transformation with parser parser combinators [PDF]
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019 Automatically transforming programs is hard, yet critical for automated program refactoring, rewriting, and repair. Multi-language syntax transformation is especially hard due to heterogeneous representations in syntax, parse trees, and abstract syntax ...
Rijnard van Tonder, Claire Le Goues
semanticscholar +4 more sources
A new view on parser combinators [PDF]
Proceedings of the 31st Symposium on Implementation and Application of Functional Languages, 2019 Parser combinators offer a concise and fast way to produce reasonably efficient parsers. The combinator libraries themselves can be small and provide an elegant application of functional programming techniques.
Pieter Koopman, Rinus Plasmeijer
semanticscholar +5 more sources
Mímico: a monadic combinator parser generator [PDF]
Journal of the Brazilian Computer Society, 2003 This article describes a compiler generator, called Mimico, that outputs code based on the use of monadic combinators. Mimico can parse infinite look-ahead and left-recursive context free grammars and defines a scheme for handling the precedence and ...
Carlos Camarão +2 more
semanticscholar +7 more sources
Ramble: Parser Combinator for R
The Journal of Open Source Software, 2017 Ramble is a parser combinator for the R (R Core Team 2016) language using the higher order functions. The combinatory parsing approached used in Ramble mirrors approaches used in functional languages such as Miranda (Hutton 1992), and is able to handle ...
Chapman Siu
semanticscholar +4 more sources
Parser Combinators: a Practical Application for Generating Parsers for NMR Data. [PDF]
Proc Int Conf Inf Technol New Gener, 2013 Nuclear Magnetic Resonance (NMR) spectroscopy is a technique for acquiring protein data at atomic resolution and determining the three-dimensional structure of large protein molecules. A typical structure determination process results in the deposition of a large data sets to the BMRB (Bio-Magnetic Resonance Data Bank).
Fenwick M +3 more
europepmc +6 more sources
Morpheus: Automated Safety Verification of Data-dependent Parser Combinator Programs [PDF]
European Conference on Object-Oriented Programming, 2023 Parser combinators are a well-known mechanism used for the compositional construction of parsers, and have shown to be particularly useful in writing parsers for rich grammars with data-dependencies and global state.
Ashish Mishra, Suresh Jagannathan
semanticscholar +7 more sources
Predictive parser combinators need four values to report errors [PDF]
Journal of Functional Programming, 1996 AbstractA combinator-based parser is a parser constructed directly from a BNF grammar, using higher-order functions (combinators) to model the alternative and sequencing operations of BNF. This paper describes a method for constructing parser combinators that can be used to build efficient predictive parsers which accurately report the cause of parsing
Andrew Partridge, David A. Wright
semanticscholar +4 more sources
Combinator Parsers: From Toys to Tools [PDF]
Electronic Notes in Theoretical Computer Science, 2001 AbstractWe develop, in a stepwise fashion, a set of parser combinators for constructing deterministic, error-correcting parsers. The only restriction on the grammar is that it is not left recursive. Extensive use is made of lazy evaluation, and the parsers constructed “analyze themselves”.
S. Doaitse Swierstra
openalex +3 more sources
Staged selective parser combinators [PDF]
Proceedings of the ACM on Programming Languages, 2020 Parser combinators are a middle ground between the fine control of hand-rolled parsers and the high-level almost grammar-like appearance of parsers created via parser generators. They also promote a cleaner, compositional design for parsers. Historically, however, they cannot match the performance of their counterparts.
Jamie Willis +2 more
openalex +4 more sources