Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine
 
PerlMonks  

Re: Perl Cannot Be Parsed: A Formal Proof

by zby (Vicar)
on Jan 30, 2008 at 22:08 UTC ( #665231=note: print w/ replies, xml ) Need Help??


in reply to Perl Cannot Be Parsed: A Formal Proof

Type inference (and as a consequence parsing?) in ML 'and I suspect many other functional languages, is complete in deterministic expotential time. For any practical reasons that's as close to undecidability as possible.


Comment on Re: Perl Cannot Be Parsed: A Formal Proof
Re^2: Perl Cannot Be Parsed: A Formal Proof
by Anonymous Monk on Aug 13, 2009 at 19:29 UTC
    No, you can parse SML without doing type inference. The (only) tricky part of SML parsing is operator fixity, which doesn't depend on types at all. And yes, SML type inference is superexponential, but only for contrived examples. So for "any practical reasons", it's not even remotely close to undecidability.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others chanting in the Monastery: (7)
As of 2014-07-29 21:42 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (228 votes), past polls