Towards efficient, typed LR parsers, François Pottier and Yann Régis-Gianas. In ACM Workshop on ML, March 2006.
The LR parser generators that are bundled with many functional programming language implementations produce code that is untyped, needlessly inefficient, or both. We show that, using generalized algebraic data types, it is possible to produce parsers that are well-typed (so they cannot unexpectedly crash or fail) and nevertheless efficient. This is a pleasing result as well as an illustration of the new expressiveness offered by generalized algebraic data types.
Recent comments
7 weeks 6 days ago
8 weeks 1 day ago
8 weeks 3 days ago
15 weeks 2 days ago
21 weeks 20 hours ago
21 weeks 1 day ago
22 weeks 21 hours ago
24 weeks 6 days ago
26 weeks 2 days ago
26 weeks 2 days ago