Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical

Re^2: Perl is not Dynamically Parseable

by Jeffrey Kegler (Hermit)
on Oct 12, 2009 at 23:45 UTC ( #800820=note: print w/replies, xml ) Need Help??

in reply to Re: Perl is not Dynamically Parseable
in thread Perl is not Dynamically Parseable

However, you tried to prove this by counter-proof.

Actually, no. The whole presentation of the counter-argument only attempts to prove that that line of counter-argument (which has been put forward in a few variations) fails. It doesn't attempt to prove Perl Unparseability. If that was your expectation I can certainly see why you saw it as falling short. My presentation of the counter-argument is like an exposition of a variation on the Sicilian Defense intending to show a chess maven why he should never play it.

Arguably the post might have been stronger without it. I've dumped it into a "readmore".

The proof is given in three forms in the TPR articles. The strongest form is the one that uses Rice's Theorem. The other two may be considered explanations intended to help those trying to understand why Perl Parsing Undecidability is provable.

  • Comment on Re^2: Perl is not Dynamically Parseable

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://800820]
[Lady_Aleena]: Module is currently 104 lines but will shirnk to 63. The script using the module is currently 40 lines but will grow to 82, 180 to 146 lines total. (This is after rewrting the data files.)

How do I use this? | Other CB clients
Other Users?
Others rifling through the Monastery: (4)
As of 2017-05-29 03:05 GMT
Find Nodes?
    Voting Booth?