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.
Type de document :
Communication dans un congrès
ACM Workshop on ML, Mar 2006, Portland, Oregon, United States. 2006
Liste complète des métadonnées

https://hal.inria.fr/inria-00629090
Contributeur : Yann Regis-Gianas <>
Soumis le : mercredi 5 octobre 2011 - 08:44:42
Dernière modification le : vendredi 25 mai 2018 - 12:02:03

Identifiants

  • HAL Id : inria-00629090, version 1

Collections

PPS | INRIA | USPC

Citation

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

Partager

Métriques

Consultations de la notice

105