Results 11 to 20 of about 81,160 (150)
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.
Doaitse Swierstra, Atze Dijkstra
core +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
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
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.
Manohar Jonnalagedda +4 more
+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
Anastasia Izmaylova +2 more
openalex +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 ...
Eric Béguet, Manohar Jonnalagedda
openalex +3 more sources
Efficient parsing with parser combinators
Science of Computer Programming, 2017 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
openalex +5 more sources
byteparsing: a functional parser combinator for mixed ASCII/binary data [PDF]
Journal of Open Source Software, 2023 Johan Hidding +1 more
openalex +2 more sources
Combinator Parsing: A Short Tutorial [PDF]
LerNet ALFA Summer School, 2009 S. Doaitse Swierstra
openalex +2 more sources
flap: A Deterministic Parser with Fused Lexing [PDF]
Proc. ACM Program. Lang., 2023 Lexers and parsers are typically defined separately and connected by a token stream. This separate definition is important for modularity and reduces the potential for parsing ambiguity. However, materializing tokens as data structures and case-switching
J. Yallop, Ningning Xie, N. Krishnaswami
semanticscholar +1 more source