Path: utzoo!utgpu!news-server.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!ucbvax!TAURUS.BITNET!shani
From: shani@TAURUS.BITNET
Newsgroups: comp.lang.perl
Subject: another regular expression question
Summary: Thanks, and another question
Keywords: rexp match
Message-ID: <1341@taurus.BITNET>
Date: 7 Jun 90 16:07:09 GMT
References: <1336@taurus.BITNET>
Sender: daemon@ucbvax.BERKELEY.EDU
Reply-To: <shani%math.tau.ac.il@CUNYVM.CUNY.EDU>
Organization: Tel-Aviv Univesity Math and CS school, Israel
Lines: 13

First, I would like to thank all those who answered my prior question, but maybe
you could help me on another thing: I need an algorithm that will compare a
regular expression to a string and will return an array, consisting of the
sections of the string that where matched by wildcards. for instance, if the
algorithm recievs the rexp "\wcp\s.*\s.*\w" and the string "cp a.a b.b",
it will return the array (a.a,b.b) (note that the \w's and \s's are not
considered wildcards, although "\s*" would have).

Thanks in advance,

O.S.

BTW: The whole thing is a part of the plsh I'm writing.