On Mon, Apr 11, 2011 at 08:43:54AM -0500, Dale Schumacher wrote: Dear Dale,
> Parsing Expression Grammars, part 3 (http://bit.ly/h9HoW1) extends the > parser toolkit to support pipelines of tree-transforming parsers, > bringing our capabilities to the level of OMeta [1]. > > [1] A. Warth and I. Piumarta. OMeta: an Object-Oriented Language for > Pattern Matching. TR?2007?003, > http://www.vpri.org/pdf/tr2007003_ometa.pdf, Viewpoints Research > Institute, 2007. Out of (selfish) curiosity, does your parser implement Warth et al.'s left recursive algorithm which is in OMeta these days? If so, does it suffer from the same problem I noted in Section 5 of this paper: http://tratt.net/laurie/research/publications/html/tratt__direct_left_recursive_parsing_expression_grammars/ I looked at your description, but wasn't easily able to work this out one way or the other. I'm asking partly because it would be interesting to see if it's a fundamental problem with Warth et al.'s algorithm, or whether it is implementation dependant. I should note, as I usually do, that not everyone thinks the problem I noted is a problem (Alex doesn't, and I respect his reasons for doing so). Yours, Laurie -- http://tratt.net/laurie/ -- Personal http://fetegeo.org/ -- Free text geocoding http://convergepl.org/ -- The Converge programming language _______________________________________________ PEG mailing list PEG@lists.csail.mit.edu https://lists.csail.mit.edu/mailman/listinfo/peg
