Re: Parser combinator problem

From: Bernd Brassel <bbr_at_informatik.uni-kiel.de>
Date: Mon, 11 Feb 2008 09:43:07 +0100

Steffen Mazanek wrote:

> In my application domain (graph parsing) sets of edges are parsed,
> so, in a sense, there is no real sequential composition. The
> right-hand side of a graph grammar rule consists of several edges
> that might be consumed in any order. However, for construction of
> the result and for the sake of efficiency it is still meaningful to
> force a particular order of evaluation.

Is that you who did the talk about graph parsing at IFL last year? I
thought it was quite interesting but if I remember it correctly there is
still some way to go for a stable approach, right?

Cheers
Bernd
_______________________________________________
curry mailing list
curry_at_lists.RWTH-Aachen.DE
http://MailMan.RWTH-Aachen.DE/mailman/listinfo/curry
Received on Mon Feb 11 2008 - 10:14:25 CET

This archive was generated by hypermail 2.3.0 : Fri Sep 20 2019 - 07:15:07 CEST