W3C home > Mailing lists > Public > xmlschema-dev@w3.org > August 2002

RE: limits of regular expressions

From: Biron,Paul V <Paul.V.Biron@kp.org>
Date: Fri, 23 Aug 2002 10:41:32 -0700
Message-Id: <8904C60CACA7D51191BC00805FEAAF43D10AFE@crdc-exch-7.crdc.kp.org>
To: "'noah_mendelsohn@us.ibm.com'" <noah_mendelsohn@us.ibm.com>, Colin Mackenzie <colin@elecmc.com>
Cc: Rainer Becker <r.becker@Nitro-Software.com>, xmlschema-dev@w3.org


> -----Original Message-----
> From:	noah_mendelsohn@us.ibm.com [SMTP:noah_mendelsohn@us.ibm.com]
> Sent:	Friday, August 23, 2002 10:21 AM
> To:	Colin Mackenzie
> Cc:	Rainer Becker; xmlschema-dev@w3.org
> Subject:	RE: limits of regular expressions
> I think this discussion is leading us down a slippery slope.  The schema 
> recommendation is clear that no language, other than a Turing-complete 
> programming language, can provide all the validation one might reasonably 
> want for one application or another.
> Bottom line: I think that regex's represent a very reasonable 80/20 point 
> in the design space.  They provide a quite powerful and generally useful 
> level of checking, without requiring that we invent a portable programming 
> language in which to capture additional logic.  Thank you very much.
Received on Friday, 23 August 2002 14:24:21 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Tuesday, 11 January 2011 00:14:34 GMT