> I've experimented in what little time I can devote with OMeta, PetitParser, > and Treetop. The debugging experience has been roughly consistent across all > three.
Casey, did you try the PetitParser IDE? If so, what did you miss? If not, please check it out (http://jenkins.lukas-renggli.ch/job/PetitParser/lastSuccessfulBuild/artifact/PetitParser-OneClick.zip). It comes with dedicated tools for grammars (editor, visualizations, profiler, debugger, ...). An earlier version of the tool is described in Section 3.5 of this paper (http://scg.unibe.ch/archive/papers/Reng10cDynamicGrammars.pdf). We are currently working on an improved IDE with grammar refactorings. Lukas > > One particular issue which has bugged me: memoization seems to carry a lot of > instance-state that's really hard to comprehend when the grammar isn't > working as I expect. It's just really hard to use that ocean of information > to figure out what I've done wrong. > > Given that with these new parsing technologies, we're pretty lucky to see > "parse error" as an error message, I can't help but think that it's worth > studying debugging strategies. Heh. :D I'm really not complaining, I'm just > pointing it out. > > Has anyone here found any technique(s) which makes debugging a grammar > written for a PEG/packrat less of a pain in the butt? > > I'd be really interested in hearing about it. > > > > _______________________________________________ > fonc mailing list > [email protected] > http://vpri.org/mailman/listinfo/fonc -- Lukas Renggli www.lukas-renggli.ch _______________________________________________ fonc mailing list [email protected] http://vpri.org/mailman/listinfo/fonc
