Re: Again wit da AND and Repetitions
roddey@u... wrote: > > Does anyone believe that these can be done in less than brute force tree search > times? Since it can obviously be turned into a DFA, it can be as efficient as a DFA (linear time). Though compiling a content model into a DFA is not consistently cheap, and I wonder how many folk will care to implement it both correctly and efficiently. My issue is the wisdom of having such features. They're not necessary, and the particular sort of "feature creep" I see happening now with XML is a worry to me. - Dave xml-dev: A list for W3C XML Developers. To post, mailto:xml-dev@i... Archived as: http://www.lists.ic.ac.uk/hypermail/xml-dev/ and on CD-ROM/ISBN 981-02-3594-1 To (un)subscribe, mailto:majordomo@i... the following message; (un)subscribe xml-dev To subscribe to the digests, mailto:majordomo@i... the following message; subscribe xml-dev-digest List coordinator, Henry Rzepa (mailto:rzepa@i...)
PURCHASE STYLUS STUDIO ONLINE TODAY!
Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced!
Download The World's Best XML IDE!
Accelerate XML development with our award-winning XML IDE - Download a free trial today!
Subscribe in XML format