|Graph parsers MLF@vm.cpd.ua.es (Mikel L. Forcada) (1994-11-23)|
|From:||"Mikel L. Forcada" <MLF@vm.cpd.ua.es>|
|Organization:||Universidad de Alicante|
|Date:||Wed, 23 Nov 1994 23:45:28 GMT|
excuse me if this is only very slightly related to the list, but
does someone know of an implementation of a graph parsing algorithm?
In particular, I am thinking about hyperedge-replacement context-free
(hyper)graph grammars, and not in the most general case. I would
be quite happy if the algorithm could parse *linear* (one nonterminal
only in the right part of the rule) hyperedge-replacement context-free
*labeled* graph grammars. The algorithms in the literature (such as
Lautemann (1990)) are too general to be practical.
I would greatly appreciate any kind of information or pointer.
Mikel L. Forcada <email@example.com>, <firstname.lastname@example.org>
Departament de Tecnologia Informatica i Computacio
E-03071 Alacant (Spain)
Return to the
Search the comp.compilers archives again.