XML Schema Regular Expression Parser

Date:      Tue, 04 Jan 2000 14:17:23 -0500
From:      Daniel Potter <dpotter@mitre.org>
To:        xml-dev@ic.ac.uk
Subject:   ANN: XML Schema Regular Expression Parser

A working model of a regular expression parser designed to parse and match strings based on the current XML Schema pattern definition is now available at http://www.xfront.org/xml-schema/. This is a Java applet (Java 1.1) and will require a Java enabled browser. It is still currently a test, meaning that there are still bugs which have yet to be fixed or even found.

Keep in mind the differences between regular expressions used in Perl and regular expressions used to specify patterns in the XML Schema spec! For example, the non-greedy operators aren't used (*?, +?); backreferencing (\1) is unavailable, and others.

However, one known lacking feature is the \p{xx} forms. Although the parser will recognize \p (or \P) it will ignore it and move on, causing the {xx} after it to be parsed, interpretting it as an {m,n} form. This in most cases will cause an error.

The source code is currently not available for general download, but anyone interested can e-mail me (dpotter@mitre.org).

Try it out and see what you think! Please send me any bugs that you discover. Thanks.

- Dan Potter

xml-dev: A list for W3C XML Developers. To post, mailto:xml-dev@ic.ac.uk
Archived as: http://www.lists.ic.ac.uk/hypermail/xml-dev/ and on CD-ROM/ISBN 
981-02-3594-1

Prepared by Robin Cover for the The SGML/XML Web Page archive.

SEARCH Advanced Search ABOUT Site Map CP RSS Channel Contact Us Sponsoring CP About Our Sponsors NEWS Cover Stories Articles & Papers Press Releases CORE STANDARDS XML SGML Schemas XSL/XSLT/XPath XLink XML Query CSS SVG TECHNOLOGY REPORTS XML Applications General Apps Government Apps Academic Apps EVENTS LIBRARY Introductions FAQs Bibliography Technology and Society Semantics Tech Topics Software Related Standards Historic	XML Schema Regular Expression Parser Date: Tue, 04 Jan 2000 14:17:23 -0500 From: Daniel Potter <dpotter@mitre.org> To: xml-dev@ic.ac.uk Subject: ANN: XML Schema Regular Expression Parser A working model of a regular expression parser designed to parse and match strings based on the current XML Schema pattern definition is now available at http://www.xfront.org/xml-schema/. This is a Java applet (Java 1.1) and will require a Java enabled browser. It is still currently a test, meaning that there are still bugs which have yet to be fixed or even found. Keep in mind the differences between regular expressions used in Perl and regular expressions used to specify patterns in the XML Schema spec! For example, the non-greedy operators aren't used (`*?`, `+?`); backreferencing (`\1`) is unavailable, and others. However, one known lacking feature is the `\p{xx}` forms. Although the parser will recognize `\p` (or `\P`) it will ignore it and move on, causing the {xx} after it to be parsed, interpretting it as an `{m,n}` form. This in most cases will cause an error. The source code is currently not available for general download, but anyone interested can e-mail me (dpotter@mitre.org). Try it out and see what you think! Please send me any bugs that you discover. Thanks. - Dan Potter xml-dev: A list for W3C XML Developers. To post, mailto:xml-dev@ic.ac.uk Archived as: http://www.lists.ic.ac.uk/hypermail/xml-dev/ and on CD-ROM/ISBN 981-02-3594-1 Prepared by Robin Cover for the The SGML/XML Web Page archive.