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.
-
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.
|