Re: Parser combinator problem

From: Bernd Brassel <bbr_at_informatik.uni-kiel.de>
Date: Mon, 11 Feb 2008 10:36:12 +0100

Steffen Mazanek wrote:

> Yes, that was me :-). And yes, there had been a lot of open questions
> at that time. However, since then several problems have been solved.
> In particular the functional-logic approach helps a lot in this domain.
> For instance, it is possible to directly translate so-called hyperedge
> replacement grammars into a parser using the combinator approach.
> And as known from logic languages that parser even can be applied
> in the other direction for graph generation. A lot of work remains to
> be done, though.

That is really interesting to hear. As soon as you got some slides or an
abstract or even a paper showing how you use Curry for that I'd be very
interested to see it.

But maybe we will see more of that here on the mailing list :o)

Greetings
Bernd


_______________________________________________
curry mailing list
curry_at_lists.RWTH-Aachen.DE
http://MailMan.RWTH-Aachen.DE/mailman/listinfo/curry
Received on Mo Feb 11 2008 - 12:03:15 CET

This archive was generated by hypermail 2.3.0 : Do Feb 01 2024 - 07:15:08 CET