Results 11 to 20 of about 296,979 (166)
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 +11 more sources
Parsing of Hyperedge Replacement Grammars with Graph Parser Combinators [PDF]
Electronic Communication of The European Association of Software Science and Technology, 2008 Graph parsing is known to be computationally expensive. For this reason the construction of special-purpose parsers may be beneficial for particular graph languages. In the domain of string languages so-called parser combinators are very popular for writing efficient parsers.
Mark Minas, Steffen Mazanek
core +5 more sources
Lazy Functional Parser Combinators in Java [PDF]
, 2001 A parser is a program that checks if a text is a sentence of the language as described by a grammar. Traditionally, the program text of a parser is generated from a grammar description, after which it is compiled and subsequently run. The language accepted by such a parser is, by the nature of this process, hardcoded in the program.
Swierstra, D.S., Dijkstra, A.
core +6 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.
Jonnalagedda, Manohar +4 more
+6 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
openaire +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 +4 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
Ali Afroozeh +2 more
openaire +3 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
openaire +4 more sources
Efficient parsing with parser combinators
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
Jan Kurš +4 more
openaire +5 more sources
InDubio: A Combinator Library to Disambiguate Ambiguous Grammars [PDF]
Communication Systems and Applications, 2020 To infer an abstract model from source code is one of the main tasks of most software quality analysis methods. Such abstract model is called Abstract Syntax Tree and the inference task is called parsing.
J. Macedo, J. Saraiva
semanticscholar +3 more sources