Results 1 to 10 of about 17,493 (90)
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.
Nicolas Wu, Jamie Willis
exaly +5 more sources
Practical, general parser combinators [PDF]
Proceedings of the 2016 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, 2016 Parser combinators are a popular approach to parsing where context-free grammars are represented as executable code. However, conventional parser combinators do not support left recursion, and can have worst-case exponential runtime. These limitations hinder the expressivity and performance predictability of parser combinators when constructing parsers
Tijs Van Der Storm
exaly +5 more sources
Efficient parsing with parser combinators [PDF]
Science of Computer Programming, 2018 Parser combinators offer a universal and flexible approach to parsing. They follow the structure of an underlying grammar, are modular, well-structured, easy to maintain, and can recognize a large variety of languages including context-sensitive ones. However, these advantages introduce a noticeable performance overhead mainly because the same powerful
Mohammad Ghafari +2 more
exaly +10 more sources
Accelerating parser combinators with macros [PDF]
Proceedings of the Fifth Annual Scala Workshop, 2014 Parser combinators provide an elegant way of writing parsers: parser implementations closely follow the structure of the underlying grammar, while accommodating interleaved host language code for data processing. However, the host language features used for composition introduce substantial overhead, which leads to poor performance.In this paper, we ...
Béguet, Eric, Jonnalagedda, Manohar
exaly +5 more sources
Staged parser combinators for efficient data processing [PDF]
ACM SIGPLAN Notices, 2014 Parsers are ubiquitous in computing, and many applications depend on their performance for decoding data efficiently. Parser combinators are an intuitive tool for writing parsers: tight integration with the host language enables grammar specifications to be interleaved with processing of parse results.
Sandro Stucki +2 more
exaly +8 more sources
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. In this paper we explore several reusable approaches to writing parsers in combinator style, focusing on easy to apply patterns ...
Nicolas Wu, Jamie Willis
exaly +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 +4 more sources
A new view on parser combinators
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. They are one of the success stories in functional programming that are also ported to many other languages.
Pieter Koopman, Rinus Plasmeijer
exaly +4 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