Skip to Main content Skip to Navigation
Conference papers

Towards efficient, typed LR parsers.

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00629090
Contributor : Yann Regis-Gianas <>
Submitted on : Wednesday, October 5, 2011 - 8:44:42 AM
Last modification on : Friday, March 27, 2020 - 4:02:56 AM

Identifiers

  • HAL Id : inria-00629090, version 1

Collections

Citation

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

Share

Metrics

Record views

214