* Parseurs de precedence
@ 1996-08-06 15:55 Matias Giovannini
0 siblings, 0 replies; only message in thread
From: Matias Giovannini @ 1996-08-06 15:55 UTC (permalink / raw)
To: Caml-list
[-- Attachment #1: Message Body --]
[-- Type: text/plain, Size: 911 bytes --]
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
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~1996-08-26 14:14 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
1996-08-06 15:55 Parseurs de precedence Matias Giovannini
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox