Re: A tricky grammar

> Wow.  That seems worth exploring.  It was with some trepidation that I
> submitted this to Aparecium, but in a couple of seconds it came back
> with:

It was not difficult to fix. CoffeeGrinder 0.10.1 works published last
night works.

I think, but have not invested much effort to determine, that this is
the first infinitely ambiguous grammar I’ve tried to parse where the
loop involved more than one node in the graph. All (?) of the other
examples are just things like:

  X: X, 'x'; 'x' .

where the loop is “self referential”.

                                        Be seeing you,
                                          norm

--
Norm Tovey-Walsh
Saxonica