If the patterns are all simple, one approach would be to represent each pattern as a list of atoms, and test whether a partial pattern can consume the buffer:
my @re= qw( [abc] b+ c );
my @tests = qw( a ab ba bb bbbbbcdef bbbbbbg );
TEST:
foreach my $buff ( @tests )
{
my @tre = @re;
my $tre = "";
while (@tre > 1)
{
$tre .= shift @tre;
if ( $buff =~ m/^$tre$/ )
{
print "Test string '$buff' matched partial pattern, $tre\n
+";
next TEST;
}
}
$tre .= shift @tre;
if ( $buff =~ m/^$tre/ )
{
print "Test string '$buff' matched whole pattern, $tre\n";
}
else
{
print "Test string '$buff' did not match pattern $tre\n";
}
}
This method will fail if you use alternation, or atoms with a minumum length > 1, such as "a{5}".
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.
|