|P is for Practical|
Re^4: Block-structured language parsing using a Perl module?by BrowserUk (Pope)
|on Aug 17, 2012 at 07:22 UTC||Need Help??|
you have to know enough theory to know both what type of parser you can use on a grammar and if your grammar is even parsable.
Hm. That would be a justification for it, but so far, none of the modules discussion even begins to allow you to answer those types of questions.
I can't speak about the performance of Regexp::Grammars, but if I were doing something like this, I'd start there for ease of use.
Hm. I'm going through the docs for Regexp::Grammars now, and trying to do so with an open mind, but honestly, what I'm reading is making my skin crawl.
The questions I am asking myself at this point are:
I'd use Marpa for speed and completeness.
The trouble with Marpa is that it only does half the job. You have to tokenise the source text yourself, and then feed it to the parser in labeled chunks.
By the time you've written the code to tokenise the input, and then recognise the tokens so you can label them for the "parser", one wonders what parsing there is left for the "parser" to do.
Its like buying a dog and barking yourself.
With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.