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

Comment on

( #3333=superdoc: print w/ replies, xml ) Need Help??

I've read about 1/3 of this and fully intend to finish it. Overall, I've given it ++. The following is intended as a constructive comment in the "RFC" sense.

I think I self-identify with your stated audience, Perl hackers that can already work with regular expressions, but don't have any formal Computer Science eduction, and don't really know how to parse things that are too complex for regular expressions. I'm currently trying my hand at an applied parsing problem (Reversible parsing (with Parse::RecDescent?)). I got as far as I did searching CPAN for "parse" and reading the doc. I'd say I got to a practical (in the parse direction, not in the reverse direction), albeit simple solution. I learned alot more from ikegami's reply. I'm also learning from the documentation for Parse::Marpa

The criticism is that I'm not sure I could have gotten to that level of practical results from yout tutorial. I think your tutorial has aimed a little high for the stated target audience. Terms like "deterministic finite automaton", "linear time", "Context Free Languages" and the whole "A bit more theory" section slow me down a little and make it a dense read. Having gone through the work I already went through, your tutorial is helpful and instructive, especially in defining some terms that the other sources have been throwing around. This gives me good academic material to compliment the quick-n-dirty applicable stuff I got from Parse::RecDescent's documentation, et al..

Just to be clear, I find this to be immensely informative, and am enjoying working my way through it. The academic terms are defined as you use them for the most part, and I'm learning alot. I think the only edit I'd suggest (partly becasue the whole article seems a little above me for me to be making significant content suggestions) is to restate the intended audience. This is an intermediate-to-advanced text that fills a niche between Perl hackers that can already work with regular expressions, but don't have any formal Computer Science eduction and the heavily technical papers that are intended for academia. Said Perl Hackers can use this to improve themselves, but I found it a little beyond (though certainly comlementary to) "practical".


#my sig used to say 'I humbly seek wisdom. '. Now it says:
use strict;
use warnings;
I humbly seek wisdom.

In reply to Re: RFC: Parsing with perl - Regexes and beyond by goibhniu
in thread RFC: Parsing with perl - Regexes and beyond by moritz

Title:
Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post; it's "PerlMonks-approved HTML":



  • Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
  • Read Where should I post X? if you're not absolutely sure you're posting in the right place.
  • Please read these before you post! —
  • Posts may use any of the Perl Monks Approved HTML tags:
    a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
  • Outside of code tags, you may need to use entities for some characters:
            For:     Use:
    & &amp;
    < &lt;
    > &gt;
    [ &#91;
    ] &#93;
  • Link using PerlMonks shortcuts! What shortcuts can I use for linking?
  • See Writeup Formatting Tips and other pages linked from there for more info.
  • Log In?
    Username:
    Password:

    What's my password?
    Create A New User
    Chatterbox?
    and the web crawler heard nothing...

    How do I use this? | Other CB clients
    Other Users?
    Others wandering the Monastery: (5)
    As of 2014-08-23 05:09 GMT
    Sections?
    Information?
    Find Nodes?
    Leftovers?
      Voting Booth?

      The best computer themed movie is:











      Results (172 votes), past polls