|
[XML-DEV Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message] Re: Non-deterministic content models
I think we should say a regular expression cannot be converted into 1-unambiguous regular expression.. cheers and regards - murali. On Thu, 17 Jul 2003, Bob Foster wrote: > From: "Henry S. Thompson" <ht@c...> > > Any non-deterministic finite-state automata can be determinized. > > > > Some non-deterministic regular expressions _cannot_ be determinized. > > > > A common example of a non-determinizable regexp is the one for chess > > games: > > > > w(bw)*b? > > I'm getting that "jargon soup" feeling. When you talk about "determinizing" > an NFA, I guess you mean converting it to a DFA. > > But when you talk about "determinizing" a regular expression, I guess you > mean converting it to a deterministic regular expression. > > No relationship between these two operatons. > > Bob Foster > > > ----------------------------------------------------------------- > The xml-dev list is sponsored by XML.org <http://www.xml.org>, an > initiative of OASIS <http://www.oasis-open.org> > > The list archives are at http://lists.xml.org/archives/xml-dev/ > > To subscribe or unsubscribe from this list use the subscription > manager: <http://lists.xml.org/ob/adm.pl> >
|
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
|
|||||||||

Cart








