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.
In reply to Re: Perl is not Dynamically Parseable
by ikegami
in thread Perl is not Dynamically Parseable
by Jeffrey Kegler
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |