tag:blogger.com,1999:blog-4836027257696992542.post6294068120259566597..comments2024-02-11T09:36:12.476+01:00Comments on ldami: Who is using Regexp::Grammars ?damihttp://www.blogger.com/profile/05175840149225722194noreply@blogger.comBlogger8125tag:blogger.com,1999:blog-4836027257696992542.post-73445107704469579512012-10-09T16:39:47.863+02:002012-10-09T16:39:47.863+02:00Well, computational time does considerably go up w...Well, computational time does considerably go up when parsing larger and larger strings that are more and more complex. For my current task, the time has gone up so much that I'm considering parallelizing my code so that each string will be processed in its own thread.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-4836027257696992542.post-66398486255509215202012-05-23T19:17:10.839+02:002012-05-23T19:17:10.839+02:00I use R::G for all my non-trivial parsing.I use R::G for all my non-trivial parsing.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-4836027257696992542.post-23157764888510597602012-05-22T18:18:52.099+02:002012-05-22T18:18:52.099+02:00I have used R::G for parsing a minilanguage (Langu...I have used R::G for parsing a minilanguage (Language::Expr) and a couple other cases. It's very convenient compared to, say, Marpa, because of integrated lexer (everything is inside regex). Last time I tried, error reporting is not that good and performance suffers for long input. For future projects I might migrate to PRD or Marpa.Steven Haryantohttps://www.blogger.com/profile/09282042440154229218noreply@blogger.comtag:blogger.com,1999:blog-4836027257696992542.post-47699591938252489032012-05-21T14:39:35.008+02:002012-05-21T14:39:35.008+02:00i gave a talk on it the last FPW :)
i used Regex...i gave a talk on it the last FPW :) <br /><br />i used Regexp::Grammar to parse some RPN queries and other stuff but the bottom up approach was too slow for log parsing for example. That's why i wrote persec (inspired by parsec combinators).<br /><br />i'll give a talk on parsec at fpw'12 http://journeesperl.fr/fpw2012/ : cya soon :)eirohttps://www.blogger.com/profile/17184475825149233529noreply@blogger.comtag:blogger.com,1999:blog-4836027257696992542.post-63470401642247498622012-05-21T12:07:54.785+02:002012-05-21T12:07:54.785+02:00There is also Marpa for writing parsers...There is also Marpa for writing parsers...Jakub Narebskihttps://www.blogger.com/profile/11847202568800326989noreply@blogger.comtag:blogger.com,1999:blog-4836027257696992542.post-50952706709499651542012-05-21T10:05:19.184+02:002012-05-21T10:05:19.184+02:00I converted one of my PRD grammars and found probl...I converted one of my PRD grammars and found problems with large inputs.<br />Regexp::Grammars just blew up. From memory (and this is a while ago) <br />I found PRD was actually quicker. Now, I didn't spend too long on the exercise once I found out that Regexp::Grammars wasn't a shinier go-faster version of PRD, so the problems are maybe resolveable, but I was very disappointed as I really could use something that has the flexibility of PRD. I hugely love the ability to skip over sections of documents that are of no interest to me via the use of nifty Regexps, allowing me to write 'Island Grammars', and was really hoping for something ten times better from the Wizard of Oz - Dr D. Sadly, it doesn't look like we have it. If some-one with an IQ on the right side of 140(SB) can come up with examples and documentation for the rest of us to follow, then I'll look at Regexp::Grammars again.Professor BraneStawmhttp://irl.runoreply@blogger.comtag:blogger.com,1999:blog-4836027257696992542.post-91590054705187571922012-05-20T16:24:24.486+02:002012-05-20T16:24:24.486+02:00^ Yes, I would love to see some examples.^ Yes, I would love to see some examples.Chankey Pathakhttp://www.technostall.com/noreply@blogger.comtag:blogger.com,1999:blog-4836027257696992542.post-34542981999101353942012-05-20T15:10:26.123+02:002012-05-20T15:10:26.123+02:00Maybe you could write up a few use cases where you...Maybe you could write up a few use cases where you found it useful?Anonymousnoreply@blogger.com