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

Re^2: Perl Cannot Be Parsed: A Formal Proof (meh)

by BrowserUk (Pope)
on Jan 21, 2008 at 19:19 UTC ( #663422=note: print w/ replies, xml ) Need Help??


in reply to Re: Perl Cannot Be Parsed: A Formal Proof (meh)
in thread Perl Cannot Be Parsed: A Formal Proof

A rather simpler demonstration is:

eval $ARGV[ 0 ];

Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.

Replies are listed 'Best First'.
Re^3: Perl Cannot Be Parsed: A Formal Proof (meh)
by tye (Sage) on Jan 21, 2008 at 19:31 UTC
    eval $ARGV[ 0 ];

    The output from perl -MO=Deparse disagrees with you. eval isn't the "problem", BEGIN is.

    - tye        

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others rifling through the Monastery: (5)
As of 2016-08-27 22:44 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    The best thing I ever won in a lottery was:















    Results (389 votes). Check out past polls.