Parser in ML

Michel Mauny 1 Daniel De Rauglaudre 1
INRIA Rocquencourt
Abstract : We present the operational semantics of stream matching as discussed. Streams are data structures such as lists, but with different primitive operations. Streams not only provide an interface to usual input/ output channels, but may used as a data structure per se, holding any kind of element. A special pattern matching construct is dedicated to streams and the actual matching process will be called parsing. The primary parsing semantics that we propose here is predictive parsing, i.e. recursive descent semantics with a one token look-ahead: although this choice seems to restrict us to the recognition of LL(1) languages, we show by examples that full functionality and parameter passing allow us to write parsers for complex languages. The operational semantics of parsers is given by transforming parsers into regular functions. We introduce a non)strict semantics of streams by translating stream expressions into more classical data structures ; we also investigate different sharing mechanisms for some of the stream operations.
Type de document :
[Research Report] RR-1659, INRIA. 1992
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 16:49:55
Dernière modification le : vendredi 16 septembre 2016 - 15:11:58
Document(s) archivé(s) le : mardi 12 avril 2011 - 19:59:27



  • HAL Id : inria-00074898, version 1



Michel Mauny, Daniel De Rauglaudre. Parser in ML. [Research Report] RR-1659, INRIA. 1992. 〈inria-00074898〉



Consultations de la notice


Téléchargements de fichiers