Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris

Re^2: Perl Cannot Be Parsed: A Formal Proof

by chromatic (Archbishop)
on Aug 14, 2009 at 02:31 UTC ( #788492=note: print w/replies, xml ) Need Help??

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

You seem to be making the claim that when you have code

BEGIN { x(); sub foo { } }

then foo() will be declared only when x() terminates.

That particular example has a flaw, but it's easy to demonstrate that the argument holds:

use Modern::Perl; sub x { say "In x!" } BEGIN { x() } sub foo!bar { say 'In foo!bar!' } BEGIN { foo!bar() }

For extra fun, run it through B::Deparse.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://788492]
[Corion]: They are aware of so many facts, they created systems to abstract them ;)

How do I use this? | Other CB clients
Other Users?
Others lurking in the Monastery: (6)
As of 2017-05-30 07:44 GMT
Find Nodes?
    Voting Booth?