[Haskell-cafe] [Off-topic]Functional parsing theory

[bieniusa]

It's not entirely clear what you mean:

Do you want to describe grammars or parsers functionally:

In the first case, parser combinators are what you want (or some
encoding of them). There are many variations on these: LL(k),
context-free, dependent. Cyclicity (of what kind?) or empty productions
are not necessarily a problem.

If you already parsed the input to an abstract syntax tree, and want to
act on this input in terms of your grammar, then attribute grammars are
what you are looking for.

- Arie

Am 06.10.2010 17:43, schrieb Maurí­cio CA:
> Hi, all,
>
> I've been working in a tool that reads a grammar with associated
> actions and act on input based on that grammar. I would like to
> rewrite it in a functional style, but I've not been able to find a
> theory that would handle any possible grammar with cyclicity and
> empty productions, and flexibility is more important for this tool
> than performance.
>
> Do you have a suggestion on that? What I'm using now is this
> (non-functional) article on Earley method:
>
>   http://www.springerlink.com/content/602270808666074p
>
> Thanks,
>
> Maurício
>
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe