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

Re^2: Unparseability is A Good Thing

by ikegami (Pope)
on Aug 23, 2009 at 15:46 UTC ( #790674=note: print w/ replies, xml ) Need Help??


in reply to Re: Unparseability is A Good Thing
in thread Unparseability is A Good Thing

If we removed just subroutine prototypes rom the language the proof would not hold any more. So the question is is there a more general proof that does not rely on prototypes?

Yes:

BEGIN { eval "sub foo {}" if rand() < 0.5; } foo 'x';
>perl -c test.pl test.pl syntax OK >perl -c test.pl String found where operator expected at test.pl line 5, near "foo 'x'" (Do you need to predeclare foo?) syntax error at test.pl line 5, near "foo 'x'" test.pl had compilation errors.

Execution is required to decide whether foo is a subroutine call or a bareword.


Comment on Re^2: Unparseability is A Good Thing
Select or Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (4)
As of 2014-10-01 23:04 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    What is your favourite meta-syntactic variable name?














    Results (40 votes), past polls