> James Clark wrote:
>
> > Define a category to be
> ...
>
> Is this basically "single type" extended so that name classes
> can be handled correctly?
Don't understand the question.
> You did not mention <ref> in your algorithm. How do you handle it?
function possibleElements...
case <ref name=x/>:
return possibleElements(deref(x));
function directCategories...
case <ref name=x/>:
return directCategories(deref(x));
function combinedElementPattern...
case <ref name=x/>:
return combinedElementPattern(deref(x));
None of these give rise to infinite recursion, because in these functions we
never recurse inside an element pattern.
You only need to guard against infinite recursion in checkAmbig.
James
