Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Re^3: A Perl vs. Java fight brews

by emazep (Priest)
on Jul 25, 2006 at 10:11 UTC ( #563466=note: print w/replies, xml ) Need Help??

in reply to Re^2: A Perl vs. Java fight brews
in thread A Perl vs. Java fight brews

Though regex support in Java was introduced several years ago (but not that many: JDK 1.4 AFAIK, 2002 circa, if we mean the java.util.regex package), it still doesn't offer advanced things such as match-time code evaluation, match-time pattern interpolation and conditional interpolation.

So, for example, with a Java regex you can't build a recursive pattern (to check for instance if the parentheses in a text are balanced), while in Perl you can ;-)


It can also be interesting to see how more verbose Java regexes are compared to Perl regexes.
Here is a simple Perl example:
my $pat = qr/a+b/; my $res = "aaab" =~ $pat;
and here is its Java counterpart:
import java.util.regex.*; Pattern pat = Pattern.compile("a+b"); Matcher mat = pat.matcher("aaab"); boolean res = mat.matches();
Really, the above 2 last lines could be substituted by the following somewhat shorter code:
boolean res = pat.matcher("aaab").matches();
but if you don't explicitly instantiate a Matcher object, you can't have several things such as match, prematch, postmatch etc. which Perl gives you for free (through the various predefined variables $&, $`, $' etc.)

Ciao, Emanuele.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://563466]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (4)
As of 2017-05-27 22:23 GMT
Find Nodes?
    Voting Booth?