Re: detecting a pattern for any?

> 
> It is not difficult to examine if a given regular tree grammar allows any tree.  
> I am aware of two efficient algorithms.

Thanks a lot, I've downloaded the papers and read them; but have realised that
I should not try to find a general solution. 

http://lists.xml.org/archives/xml-dev/200401/msg00022.html

Instead, I should just detect that a pattern is generated from a common way
to write 'the rest is anything', that is,

  any = (element *{any}|attribute *{text}|text)*

with some variations. I've implemented it, and now ARX only parses the document
as far as it is required to make a decision.

David Tolpin
http://davidashen.net