- From: Maciej Stachowiak <mjs@apple.com>
- Date: Mon, 18 Apr 2011 19:35:27 -0700
- To: Julian Reschke <julian.reschke@gmx.de>
- Cc: Adam Barth <ietf@adambarth.com>, public-iri@w3.org
Perl and JavaScript regular expressions are approximately supersets of POSIX regular expressions. Regards, Maciej On Apr 18, 2011, at 11:19 AM, Julian Reschke wrote: > On 18.04.2011 19:26, Adam Barth wrote: >> On Mon, Apr 18, 2011 at 9:18 AM, Julian Reschke<julian.reschke@gmx.de> wrote: >>> On 18.04.2011 18:08, Adam Barth wrote: >>>>> I think it would be extremely useful to have a comparison how those tests >>>>> with absolute URIs would be parsed by the regexp in the URI spec: >>>>> >>>>> <http://greenbytes.de/tech/webdav/rfc3986.html#rfc.section.B> >>>>> >>>>> Are there differences? And if there are, do UAs agree on what to do with >>>>> those inputs? >>>> >>>> Is there an easy way to execute that regular expression? That >>>> document doesn't provide a reference defining the semantics of the >>>> regular expression. It alludes to POSIX regular expressions. Is >>>> there some way to write a POSIX program that executes it? In any >>>> case, I'd be happy to consider it if someone can explain to me how to >>>> run it over the test suite mentioned above. >>> >>> How about just using JS regexps, and see where we can get from there? >> >> Is that correct? JS regular expressions are Perl-compatible regular >> expressions. Is that the same as POSIX regular expressions in this >> context? >> >> Adam > > I don't know for sure but I'm pretty confident it won't make a difference for that particular one. > > Best regards, Julian >
Received on Tuesday, 19 April 2011 02:35:58 UTC