(original) (raw)
The maintainer is David Beazley and as far as I recall he has not expressed an opinion on this particular question. It would obviously need his agreement (and maintenance commitment) if it is to fly.
On 13 Jul 2013, at 07:41, Terry Reedy <tjreedy@udel.edu> wrote:
\> On 7/13/2013 12:10 AM, Eric Snow wrote:
\>>
\>> On Feb 27, 2013 4:31 AM, "Michael Foord" <fuzzyman@voidspace.org.uk
\>
\>> > +1 PLY is capable and well tried-and-tested. We used it in Resolver
\>> One to implement a pretty large grammar and it is (in my opinion) best
\>> of breed in the Python parser generator world. Being stable and widely
\>> used, with an "available maintainer", makes it an ideal candidate for
\>> standard library inclusion.
\>>
\>> Is this still on the table?
\>
\> Who is the maintainer and what is his opinion?
The only downside to including PLY might be the fact that there are very few people walking around who've actually had to *implement* an LALR(1) parser generator. Some of the code for that is extremely hairy and mathematical. At this time, I don't think there are any bugs in it, but it's not the sort of thing that one wants to wander into casually. Also, there are some horrible hacks in PLY that I'd really like to get rid of, but am currently stuck with due to backwards compatibility issues.
Alex Gaynor has been working on a PLY variant (RPLY) geared at RPython and which has a slightly different programming interface. I'd say if we were to go down this route, he and I should work together to put together some kind of more general "parsing.lalr" package (or similar) that cleans it up and makes it more suitable as a library for building different kinds of parsing tools on top of.
Cheers,
Dave