Date: 6 Aug 1996 12:55:53 -0300
From: "Matias Giovannini" <mgiovann@script.org.ar>
Subject: Parseurs de precedence
To: "Caml-list" <caml-list@pauillac.inria.fr>
Bonjour,
est-ce qu'il y a aucune implementation de parseurs de precedence =
d'ordre superieur en Caml? Specifiquement, je pense a parseurs de =
precedence parametrises par le jeu d'operateurs (donne comme table de =
hachage, par example) munis de ses precedences. J'utilise Caml-light =
pour Mac, e je ne veux pas utiliser Caml-lex ou Caml-yacc, puisque je =
suis interese a l'algorithme.
Merci beaucoup,
Matias Giovannini
mgiovann@script.org.ar
Hello,
is there any implementation of higher-order parsers for precedence =
grammars in Caml? More specifically, I'm thinking of precedence =
parsers parameterized by the set of operators (for instance, given as =
a hash table) together with their precedence. I'm using Caml-light for =
Mac, and I'm not willing to use Caml-lex or Caml-yacc, I'm more =
interested in the algorithm than anything else.
Thank you,
Matias Giovannini
mgiovann@script.org.ar