Parallel Parsing Processes
Artikel i vetenskaplig tidskrift, 2004

We derive a combinator library for non-deterministic parsers with a monadic interface, by means of successive refinements starting from a specification. The choice operator of the parser implements a breadth-first search rather than the more common depth-first search, and can be seen as a parallel composition between two parsing processes. The resulting library is simple and efficient for “almost deterministic” grammars, which are typical for programming languages and other computing science applications.

Författare

Koen Lindström Claessen

Chalmers, Institutionen för datavetenskap, Funktionell programmering

Chalmers, Institutionen för datavetenskap, Formella metoder

Journal of Functional Programming

0956-7968 (ISSN) 1469-7653 (eISSN)

Vol. 14 741--757-

Ämneskategorier

Data- och informationsvetenskap

DOI

10.1017/S0956796804005192