[Haskell-cafe] Parser left recursion

[Kim-Ee Yeoh]

On Sun, Feb 24, 2013 at 7:09 PM, Roman Cheplyaka <roma at ro-che.info> wrote:

> Thus, your
> recursion is well-founded — you enter the recursion with the input
> strictly smaller than you had in the beginning.
>

Perhaps you meant /productive/ corecursion? Because the definition "A ::= B
A" you gave is codata.

-- Kim-Ee
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20130224/3f04b598/attachment.htm>