Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask
 
PerlMonks  

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

by moritz (Cardinal)
on Jan 21, 2008 at 17:57 UTC ( #663408=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

As Jeffrey pointed out it means that you can't reliably parse perl code without executing it.

This means that things like static code analysis, code transformation and syntax hilighting will never be reliable.

This is a drawback indeed, but on the other hand it means that modules can extend Perl's syntax, and that other nifty stuff can be accomplished.

So I understand this node as a proof of a property that is seldom fully understood.


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

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (6)
As of 2015-01-27 11:07 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My top resolution in 2015 is:

















    Results (200 votes), past polls