The approach I would have taken:
The hypothesis is
Perl cannot be parsed
which is to say
There exists a program for which two instance of the Perl parser produce different output
which is true if
There exists a function call in a program for which two instance of the Perl parser have different prototypes for the named function.
This is actually very simple to prove by example.
However, you tried to prove this by counter-proof. That means you need to disprove the counter-hypothesis
For every function call in every program, every instance of the Perl parser will have the same prototype for the named function.
No problem there either. This can be disprove with the same example.
-
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.
|
