From mboxrd@z Thu Jan  1 00:00:00 1970
Message-ID: <a560a5d00810241041w798aa12clb4e425eb74360408@mail.gmail.com>
Date: Fri, 24 Oct 2008 19:41:41 +0200
From: "Rudolf Sykora" <rudolf.sykora@gmail.com>
To: "Fans of the OS Plan 9 from Bell Labs" <9fans@9fans.net>
In-Reply-To: <20081024170237.68ED28DE7@okapi.maths.tcd.ie>
MIME-Version: 1.0
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: 7bit
Content-Disposition: inline
References: <a560a5d00810240108q62854ec1w16614c90c7071436@mail.gmail.com>
	<765ef13a653652d5fcef9001ff70f814@quanstro.net>
	<a560a5d00810240911gee79793h966c6f325ce19f97@mail.gmail.com>
	<20081024170237.68ED28DE7@okapi.maths.tcd.ie>
Subject: Re: [9fans] non greedy regular expressions
Topicbox-Message-UUID: 26431ef0-ead4-11e9-9d60-3106f5b1d025

2008/10/24 John Stalker <stalker@maths.tcd.ie>:
> I think you've understood correctly.  Back references mostly aren't
> there.  Greedy operators aren't there.

you probably mean NON-greedy ops.
I was not that concerned about backreferences but submatch extraction
(according to the terminology used by R. Cox in his article).
R.

PS.: and submatch extraction is there, somehow, undocumented (to my knowledge)