Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

Re^2: What Perl CAN'T do?

by Courage (Parson)
on Dec 15, 2005 at 09:37 UTC ( #516894=note: print w/ replies, xml ) Need Help??


in reply to Re: What Perl CAN'T do?
in thread What Perl CAN'T do?

your 2nd and 3rd points are very questionable.

Very often Perl is more real-time than C.
Agree with me or not, but I saw several times a discussion when it appears that GCC is incapable to compile some large autogenerated programs, because it uses O(N*N) in many places. Therefore people bother splitting such sources to chunks.
Ideal programmer will create faster programs in C, but real-world programmers often write

for (i=0; i<strlen(s); i++) { // and never notice that counting lentgth is on every iteration }
It is unrealistic to use advanced techniques on C everywhere,
in perl it is often hard to write bad: you often save precalculated values in hash, and so on.

As for 3rd item - embedding perl into different application is very common practice (well, cases when bytes count are exclusion, but those are rare, IMHO).


Comment on Re^2: What Perl CAN'T do?
Download Code

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://516894]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (13)
As of 2014-08-20 07:15 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The best computer themed movie is:











    Results (107 votes), past polls