Re: Is this ambiguous?

> - I think that some ways of recording parsing results may make it easy
>   to see whether there is more than one XML AST for a given sentence,
>   but I'm not sure that's true for every possible approach.

FWIW, my implementation does a depth first search of the parse forest,
ignoring loops. At every node where it detects more than one possible
parse, it sets down a marker noting how many possible parses there are.

Later, it offers the user the option of enumerating all of the possible
parses by “counting off the markers” so to speak.

I haven’t tried it yet, but I believe that if I tell the search to
ignore multiple parses on nodes that won’t be serialized in the XML,
I’ll get a result that amounts to enumerating all of the possible
different VXML results. In my toy grammar from before, I think there
would only be one such parse, and consequently no ambiguity.

                                        Be seeing you,
                                          norm

--
Norm Tovey-Walsh
Saxonica