Thanks for the extra info :) I did a few tests and confirmed that this regex library appears to work for the regular expressions I will need to parse. Character class subtractions (a feature somewhat unique to the XML Schema regex language) seems to work, and it does appear to implicitly anchor the expressions as if they started with ^ and ended with $.
I don't think I will need a "replace" feature since I am just taking regular expressions from "pattern" fields in xsd files and using them to match strings. Thanks, Tim On Sat, Mar 20, 2021 at 3:30 PM Liam R. E. Quin <l...@fromoldbooks.org> wrote: > On Sat, 2021-03-20 at 00:05 -0400, Timothy Wrona via xml wrote: > > Hi, > > > > I am working on a library that will need to parse strings using > > regular > > expressions conformant to the XML Schema regular expression grammar > > A side-note: XPath 3 (and 2 actually) extends the regular expressions, > because it adds replace(), and XML Schema regular expressions weren't > designed for that. > > Schema's regular expressions are also implicitly anchored as if they > started and ended with ^ and $, which limits their usefulness in > parsing; likely the underlying C code enforces that outside the regexp > engine though. > > Liam > > -- > Liam Quin, https://www.delightfulcomputing.com/ > Available for XML/Document/Information Architecture/XSLT/ > XSL/XQuery/Web/Text Processing/A11Y training, work & consulting. > Barefoot Web-slave, antique illustrations: http://www.fromoldbooks.org > >
_______________________________________________ xml mailing list, project page http://xmlsoft.org/ xml@gnome.org https://mail.gnome.org/mailman/listinfo/xml
