In functional programming, a parser combinator is a higher-order function that accepts several parsers as input and returns a new parser as its output. In this context, a parser is a function accepting strings as input and returning some structure as output, typically a parse tree or a set of indices representing locations in the string where parsing stopped successfully. Parser combinators enable a recursive descent parsing strategy that facilitates modular piecewise construction and testing. This parsing technique is called combinatory parsing.
Parsers built using combinators are straightforward to construct, ‘readable,’ modular, well-structured and easily maintainable. They have been used extensively in the prototyping of compilers and processors for domain-specific languages such as natural-language interfaces to databases, where complex and varied semantic actions are closely integrated with syntactic processing. In 1989, Richard Frost and John Launchbury demonstrated use of parser combinators to construct natural-language interpreters. Graham Hutton also used higher-order functions for basic parsing in 1992. S.D. Swierstra also exhibited the practical aspects of parser combinators in 2001. In 2008, Frost, Hafiz and Callaghan described a set of parser combinators in Haskell that solve the long-standing problem of accommodating left recursion, and work as a complete top-down parsing tool in polynomial time and space.
In functional programming, parser combinators can be used to combine basic parsers to construct parsers for more complex rules. For example, a production rule of a context-free grammar (CFG) may have one or more ‘alternatives’ and each alternative may consist of a sequence of non-terminal(s) and/or terminal(s), or the alternative may consist of a single non-terminal or terminal or the empty string. If a simple parser is available for each of these alternatives, a parser combinator can be used to combine each of these parsers, returning a new parser which can recognise any or all of the alternatives.
A parser combinator can take the form of an infix operator, used to ‘glue’ different parsers to form a complete rule. Parser combinators thereby enable parsers to be defined in an embedded style, in code which is similar in structure to the rules of the grammar. As such, implementations can be thought of as executable specifications with all the associated advantages.
To keep the discussion relatively straightforward, we discuss parser combinators in terms of recognizers only. If the input string is of length
#input and its members are accessed through an index
j, a recognizer is a parser which returns, as output, a set of indices representing positions at which the parser successfully finished recognizing a sequence of tokens that began at position
j. An empty result set indicates that the recognizer failed to recognize any sequence beginning at index
j. A non-empty result set indicates the recognizer ends at different positions successfully.
emptyrecognizer recognizes the empty string. This parser always succeeds, returning a singleton set containing the current position:
- A recognizer
term ’x’recognizes the terminal
x. If the token at position
jin the input string is
x, this parser returns a singleton set containing
j + 1; otherwise, it returns the empty set.
Note that there may be multiple distinct ways to parse a string while finishing at the same index: this indicates an ambiguous grammar. Simple recognizers do not acknowledge these ambiguities; each possible finishing index is listed only once in the result set. For a more complete set of results, a more complicated object such as a parse tree must be returned.
Following the definitions of two basic recognizers
q, we can define two major parser combinators for alternative and sequencing:
- The ‘alternative’ parser combinator, ⊕, applies both of the recognizers on the same input position
jand sums up the results returned by both of the recognizers, which is eventually returned as the final result. It is used as an infix operator between
- The sequencing of recognizers is done with the ⊛ parser combinator. Like ⊕, it is used as an infix operator between
q. But it applies the first recognizer
pto the input position
j, and if there is any successful result of this application, then the second recognizer
qis applied to every element of the result set returned by the first recognizer. ⊛ ultimately returns the union of these applications of q.
Consider a highly ambiguous context-free grammar,
s ::= ‘x’ s s | ε. Using the combinators defined earlier, we can modularly define executable notations of this grammar in a modern functional language (e.g. Haskell) as
s = term ‘x’ <*> s <*> s <+> empty. When the recognizer
s is applied on an input sequence
xxxxx at position
1, according to the above definitions it would return a result set
Shortcomings and solutions
Parser combinators, like all recursive descent parsers, are not limited to the context-free grammars and thus do no global search for ambiguities in the LL(k) parsing Firstk and Followk sets. Thus, ambiguities are not known until run-time if and until the input triggers them. In such cases, the recursive descent parser may default (perhaps unknown to the grammar designer) to one of the possible ambiguous paths, resulting in semantic confusion (aliasing) in the use of the language. This leads to bugs by users of ambiguous programming languages, which are not reported at compile-time, and which are introduced not by human error, but by ambiguous grammar. The only solution which eliminates these bugs is to remove the ambiguities and use a context-free grammar.
The simple implementations of parser combinators have some shortcomings, which are common in top-down parsing. Naïve combinatory parsing requires exponential time and space when parsing an ambiguous context-free grammar. In 1996, Frost and Szydlowski demonstrated how memoization can be used with parser combinators to reduce the time complexity to polynomial. Later Frost used monads to construct the combinators for systematic and correct threading of memo-table throughout the computation.
Like any top-down recursive descent parsing, the conventional parser combinators (like the combinators described above) will not terminate while processing a left-recursive grammar (e.g.
s ::= s <*> term ‘x’|empty). A recognition algorithm that accommodates ambiguous grammars with direct left-recursive rules is described by Frost and Hafiz in 2006. The algorithm curtails the otherwise ever-growing left-recursive parse by imposing depth restrictions. That algorithm was extended to a complete parsing algorithm to accommodate indirect as well as direct left-recursion in polynomial time, and to generate compact polynomial-size representations of the potentially exponential number of parse trees for highly ambiguous grammars by Frost, Hafiz and Callaghan in 2007. This extended algorithm accommodates indirect left recursion by comparing its ‘computed context’ with ‘current context’. The same authors also described their implementation of a set of parser combinators written in the Haskell programming language based on the same algorithm.
- Burge, William H. (1975). Recursive Programming Techniques. The Systems programming series. Addison-Wesley. ISBN 0201144506.
- Frost, Richard; Launchbury, John (1989). "Constructing natural language interpreters in a lazy functional language" (PDF). The Computer Journal. Special edition on Lazy Functional Programming 32 (2): 108–121. doi:10.1093/comjnl/32.2.108.
- Frost, Richard A.; Szydlowski, Barbara (1996). "Memoizing Purely Functional Top-Down Backtracking Language Processors" (PDF). Sci. Comput. Program. 27 (3): 263–288. doi:10.1016/0167-6423(96)00014-7.
- Frost, Richard A. (2003). "Monadic Memoization towards Correctness-Preserving Reduction of Search" (PDF). Proceedings of the 16th Canadian Society for Computational Studies of Intelligence Conference on Advances in Artificial Intelligence (AI'03): 66–80. ISBN 3-540-40300-0.
- Frost, Richard A.; Hafiz, Rahmatullah (2006). "A New Top-Down Parsing Algorithm to Accommodate Ambiguity and Left Recursion in Polynomial Time" (PDF). ACM SIGPLAN Notices 41 (5): 46–54. doi:10.1145/1149982.1149988.
- Frost, Richard A.; Hafiz, Rahmatullah; Callaghan, Paul (2007). "Modular and Efficient Top-Down Parsing for Ambiguous Left-Recursive Grammars". Proceedings of the 10th International Workshop on Parsing Technologies (IWPT), ACL-SIGPARSE: 109–120. CiteSeerX: 10
.1 .1 .97 .8915.
- Frost, Richard A.; Hafiz, Rahmatullah; Callaghan, Paul (2008). "Parser Combinators for Ambiguous Left-Recursive Grammars". Proceedings of the 10th International Symposium on Practical Aspects of Declarative Languages (PADL). ACM-SIGPLAN 4902: 167–181. doi:10.1007/978-3-540-77442-6_12. ISBN 3-540-77441-6. CiteSeerX: 10
.1 .1 .89 .2132.
- Hutton, Graham (1992). "Higher-order functions for parsing" (PDF). Journal of Functional Programming 2 (3): 323–343. doi:10.1017/s0956796800000411.
- Okasaki, Chris (1998). "Even higher-order functions for parsing or Why would anyone ever want to use a sixth-order function?". Journal of Functional Programming 8 (2). doi:10.1017/S0956796898003001.
- Swierstra, S. Doaitse (2001). "Combinator parsers: From toys to tools" (PDF). Electronic Notes in Theoretical Computer Science 41. doi:10.1016/S1571-0661(05)80545-6.
- Wadler, Philip (1985). "How to replace failure by a list of successes — A method for exception handling, backtracking, and pattern matching in lazy functional languages". Proceedings of a Conference on Functional Programming Languages and Computer Architecture: 113–128. ISBN 0-387-15975-4.