Towards efficient, typed LR parsers. - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

Towards efficient, typed LR parsers.


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.
No file

Dates and versions

inria-00629090 , version 1 (05-10-2011)


  • HAL Id : inria-00629090 , version 1


François Pottier, Yann Régis-Gianas. Towards efficient, typed LR parsers.. ACM Workshop on ML, Mar 2006, Portland, Oregon, United States. ⟨inria-00629090⟩
78 View
0 Download


Gmail Facebook X LinkedIn More