Re: Regular Expressions in XPath 2.0
> I thought I'll share the above presentation as regular > expressions in XPath are based on Perl.
Good point, thank you for clarifying.
There are some interesting trade-offs between the time taken to compile a regular expression and the time taken to execute it. Determinizing an NFA can be an expensive operation. This is rarely discussed in the theory, as far as I can tell, though some of the papers do talk about incremental determinization. You see this in schema processors (which use the regular expression approach to validate an XML document against a grammar) - Saxon creates a deterministic FSA for this, which has excellent run-time performance, but in pathological cases creating the DFSA can be extremely slow.
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