in reply to Perl Cannot Be Parsed: A Formal Proof
Any language which has any sort of an eval construct “cannot be parsed” statically, because “that which is to be parsed” is determined at runtime. So it really doesn't take computer science to prove that.
Furthermore, let the record show that when you input any Perl program into the Perl compiler, it will be parsed, and you'll either get results or error-messages.
Bottom line is: what's the point here? What are you saying about Perl, and about what (if anything) should be done to address this “issue?” What does this formality actually do for us as practitioners who make our daily bread from this tool?
|
---|
Replies are listed 'Best First'. | |
---|---|
Re^2: Perl Cannot Be Parsed: A Formal Proof
by Anonymous Monk on Jan 28, 2008 at 01:48 UTC | |
by Anonymous Monk on Jan 28, 2008 at 03:08 UTC | |
by perlfan (Vicar) on Jan 28, 2008 at 03:47 UTC | |
by chromatic (Archbishop) on Jan 28, 2008 at 05:17 UTC | |
Re^2: Perl Cannot Be Parsed: A Formal Proof
by Anonymous Monk on Jan 25, 2008 at 21:47 UTC |
In Section
Meditations