Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change
 
PerlMonks  

Re^2: Perl not BNF-able??

by anonymized user 468275 (Curate)
on Jul 04, 2005 at 08:48 UTC ( [id://472175] : note . print w/replies, xml ) Need Help??


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

This 471967 is the best explanation so far of why perl defies BNF although some other posts arguably provide better insight into the problems of parsing perl, which of course is also an important motivation for my OP.

Yes I chose lisp in my comment as a contrary example because its BNF is about the simplest. Here is one version of it:

http://cui.unige.ch/db-research/Enseignement/analyseinfo/LISP/BNFlisp.html

One world, one people

Replies are listed 'Best First'.
Re^3: Perl not BNF-able??
by QM (Parson) on Jul 05, 2005 at 20:57 UTC
    Just a comment on linking (tried this with /msg, but there's not enough characters there):

    Have you seen Link Shortcuts? I'm not sure, but the explicit URL you used may log some people out (depending on how they come into Perl Monks.).

    My understanding is the best way to do this is:

    [id://471967|Your Description Here]

    -QM
    --
    Quantum Mechanics: The dreams stuff is made of