Parser combinators are a popular approach to parsing where context-free grammars are
represented as executable code. However, conventional parser combinators do not support …

Valiant (1975) has developed an algorithm for recognition of context free languages. As of
today, it remains the algorithm with the best asymptotic complexity for this purpose. In this …

This paper introduces sets of binary subtree representations as an alternative to shared
packed parse forests as the output of a generalised parser, and shows how these may be …

Generalised parsing has become increasingly important in the context of software language
design and several compiler generators and language workbenches have adopted …

At SLE in 2014, Ridge presented the P3 combinator library with which parsers can be
developed for left-recursive, non-deterministic and ambiguous grammars. A combinator …

Abstract Augmented Backus-Naur Form (ABNF) is a standardized formal grammar notation
used in several Internet syntax specifications. This paper describes (i) a formalization of the …

Parser generators and parser combinator libraries are the most popular tools for producing
parsers. Parser combinators use the host language to provide reusable components in the …

Parsing is the process of analyzing a sequence of symbols and producing a hierarchical
structure. Parsing is a common task in many applications, ranging from analyzing network …

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 …