[XML-DEV Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message]

Which algorithm do XML Schema validators use to decide if a stringmatche

• From: "Costello, Roger L." <costello@mitre.org>
• To: "xml-dev@lists.xml.org" <xml-dev@lists.xml.org>
• Date: Wed, 26 Jan 2011 10:56:35 -0500

Hi Folks,

It is my understanding that there are 3 flavors of regular expression parsers [1]:

1. Nondeterministic Finite Automaton (NFA)

2. Deterministic Finite Automaton (DFA)

3. Backtracking

Which flavor of regular expression parser does SAXON use?

Which flavor of regular expression parser does XERCES use?

Which flavor of regular expression parser does MSXML use?

What about the other XML Schema validators?

/Roger


[1] http://en.wikipedia.org/wiki/Regular_expression#Implementations_and_running_times 

• Follow-Ups:
  • Re: Which algorithm do XML Schema validators use to decideif a string matches a regular expression?
    • From: Michael Kay <mike@saxonica.com>
  • Re: Which algorithm do XML Schema validators use to decide if astring matches a regular expression?
    • From: Richard Salz <rsalz@us.ibm.com>