Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much
 
PerlMonks  

Re^3: Perl not BNF-able??

by adamk (Chaplain)
on Jul 02, 2005 at 08:32 UTC ( [id://471893]=note: print w/replies, xml ) Need Help??


in reply to Re^2: Perl not BNF-able??
in thread Perl not BNF-able??

Since I wrote PPI, I probably have struggled against more anti-BNF things that most. So here's a few.

1. Source Filters
use Acme::Buffy; BuFFy BUFfy bufFy Buffy...
You can't handle source filters in BNF for obvious reasons.

2. BEGIN blocks

You can't (code) parse Perl without also executing it.
BEGIN { die if is_christmas($today); }
That code is legal Perl every day of the year except for Christmas, when it is not legal Perl code.

3. Cannot be parsed when isolated
use Some 'function'; function 'foo', 'bar';
That code could mean either function('foo'), 'bar' or function( 'foo', 'bar' ) depending on what is in the Some module.

If Some.pm isn't installed on your machine, how are you to know.

PPI does what it does using more evil than Perl itself, and certainly more heuristics. It makes up for it's guesses by promising that what it writes out is ALWAYS character for character identical to what it read in, unless you change something.

So if it has a problem, it won't break as long as you don't change that part of the tree.

There's probably more reasons, but for me those are the big three.

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others browsing the Monastery: (3)
As of 2024-04-25 12:01 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found