[Date Prev] | [Thread Prev] | [Thread Next] | [Date Next] -- [Date Index] | [Thread Index] | [Elist Home]
Subject: Re: [relax-ng] Making ambiguous schemas deterministic
On Thu, 11 Jul 2002 10:07:12 +0200 Eric van der Vlist <vdv@dyomedea.com> wrote: > I *think* (but may be wrong) that it shouldn't be much more complex than > defining the order in which patterns should be checked and in the simple > form of a Relax NG schema there are only 3 patterns with more than one > non name class sub-pattern: group for which the order is obvious, choice > and interleave. I plan to create a non-deterministic binary tree automaton from a RELAX NG schema. The correspondence between transitions of such non-deterministic binary tree automata and original patterns is not straightforward. James Clark wrote: > I think this would be straightfoward for a naive backtracking implementation > to deal with, but I suspect it would be harder for a derivative-based > streaming implementation, but I haven't thouoght about it enough to be sure. I have exactly the same feeling. Cheers, -- MURATA Makoto (FAMILY Given) <EB2M-MRT@asahi-net.or.jp>
[Date Prev] | [Thread Prev] | [Thread Next] | [Date Next] -- [Date Index] | [Thread Index] | [Elist Home]
Powered by eList eXpress LLC