[Home] [By Thread] [By Date] [Recent Entries]
Title: RE: Non-deterministic content model Here's another interesting one:
This is like "matching parenthesis" in mathematics. Or am I cheating now because I use two elements? Note that any recognizer will need a stack to "remember" all a's seen and then pop an 'a' for each 'b'. This is typical for non finite state automaton (deterministic or not) based recognizers. Wilco. -----Original Message-----
Arthur Rother wrote: > I came across this one in my first lessons on learning DTD's, where I tried
That's a neat example. It's well-known that ((a,b)*,a?)
> If this is the only endless case, one could hardcode this in the parser. It's not -- there's an infinite number of "hopelessly ambiguous"
> How do [XML Spy and XMetal] deal with it? There are plenty of algorithms for regular expression
The only real problem with nondeterministic
--Joe English jenglish@f... ------------------------------------------------------------------
The list archives are at http://lists.xml.org/archives/xml-dev/ To unsubscribe from this elist send a message with the single word
|

Cart



