Cart
[Home] [By Thread] [By Date] [Recent Entries]
* John Cowan
|
| IIRC the canonical way of doing (A & B & C) is to transform it into
| (A | B | C)* and then do a post-check that each of A, B, C appears
| exactly once. As opposed to brute-force expansion into a DFA.
Hmmm. It sounds as if this could be extended to handle {n,m}A as well.
Just transform it into A+ (or *, depending on n) and do a post-check
that the number is correct.
In fact, this solution looks relatively easy to implement.
--Lars M.
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...)
|
