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

Re: Levels of strictness and compatibility

by BrowserUk (Patriarch)
on Feb 17, 2014 at 00:21 UTC ( [id://1075113]=note: print w/replies, xml ) Need Help??


in reply to Levels of strictness and compatibility

Problem:

  • If you employ none of them:

    It is almost impossible to write a program -- that despite compiling clean -- functions correctly.

  • If you employ all of them;

    It is almost impossible to write a program that actually compiles -- even if it would function perfectly correctly.

So the challenge as a newbie is what level of prophylactic should you employ?

And as a reasonably experienced Perler; what level should you employ to ensure that your perfectly functional code cannot be trivial modified in an incorrect way without tripping a warning or error of some kind; without having burdened it with overhead such that it is entirely useless?

And, IMO, the answer is: you cannot. In the end, one has to assume some more-than-beginner, less-than-expert level of competence from those that will follow you.

Attempting to pander to the lowest common denominator, is an exercise in futility; and more damaging to the language than obfuscation!


With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others examining the Monastery: (4)
As of 2024-03-29 11:10 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found