Results 11 to 20 of about 13,549 (110)
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 +4 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 associativity of binary infix operators, and monadic code in semantic rules. Mimico provides an easy way
CARLOS Camarao
exaly +5 more sources
Parsley: optimising and improving parser combinators
, 2023 Parser combinators are a functional abstraction for parsing that abstracts hand-written recursive-descent parsers behind a high-level set of combinators. While these kinds of parsers are popular in the functional programming community, they have been historically criticised: * Parser combinator performance is sub-par compared with handwritten parsers. *
Willis, Jamie
openaire +3 more sources
Combinator Parsers: From Toys to Tools
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”.
exaly +3 more sources
Ramble: Parser Combinator for R
Journal of Open Source Software, 2017 Chapman Siu
exaly +3 more sources
Monadic parser combinators [PDF]
, 1996 In functional programming, a popular approach to building recursive descent parsers is to model parsers as functions, and to define higher-order functions (or combinators) that implement grammar constructions such as sequencing, choice, and repetition.
Hutton, Graham, Meijer, Erik
core +3 more sources
Morpheus: Automated Safety Verification of Data-dependent Parser Combinator Programs [PDF]
, 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.
Mishra, Ashish, Jagannathan, Suresh
core +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
openaire +2 more sources
Strategic Entrepreneurship Journal, Volume 17, Issue 4, Page 886-924, December 2023., 2023 Abstract Research Summary Recently, the venture capital (VC) industry has experienced the entry of several new capital providers. Using US data on investors and their portfolio startups from 2000 to 2022, we document the emergence of a new type of investors: the micro VC.
Mario Daniele Amore +2 more
wiley +1 more source
Parser combination by reparsing [PDF]
Proceedings of the Human Language Technology Conference of the NAACL, Companion Volume: Short Papers on XX - NAACL '06, 2006 We present a novel parser combination scheme that works by reparsing input sentences once they have already been parsed by several different parsers. We apply this idea to dependency and constituent parsing, generating results that surpass state-of-the-art accuracy levels for individual parsers.
Kenji Sagae, Alon Lavie
openaire +2 more sources