ANNOUNCE revision 6498:e21e9ab5fad0
112855Sgabeblack@google.comMarch 24, 2009
212855Sgabeblack@google.com
312855Sgabeblack@google.com                  Announcing :  PLY-3.2 (Python Lex-Yacc)
412855Sgabeblack@google.com
512855Sgabeblack@google.com                        http://www.dabeaz.com/ply
612855Sgabeblack@google.com
712855Sgabeblack@google.comI'm pleased to announce a significant new update to PLY---a 100% Python
812855Sgabeblack@google.comimplementation of the common parsing tools lex and yacc.  PLY-3.2 adds
912855Sgabeblack@google.comcompatibility for Python 2.6 and 3.0, provides some new customization
1012855Sgabeblack@google.comoptions, and cleans up a lot of internal implementation details.
1112855Sgabeblack@google.com
1212855Sgabeblack@google.comIf you are new to PLY, here are a few highlights:
1312855Sgabeblack@google.com
1412855Sgabeblack@google.com-  PLY is closely modeled after traditional lex/yacc.  If you know how 
1512855Sgabeblack@google.com   to use these or similar tools in other languages, you will find
1612855Sgabeblack@google.com   PLY to be comparable.
1712855Sgabeblack@google.com
1812855Sgabeblack@google.com-  PLY provides very extensive error reporting and diagnostic
1912855Sgabeblack@google.com   information to assist in parser construction.  The original
2012855Sgabeblack@google.com   implementation was developed for instructional purposes.  As
2112855Sgabeblack@google.com   a result, the system tries to identify the most common types
2212855Sgabeblack@google.com   of errors made by novice users.
2312855Sgabeblack@google.com
2412855Sgabeblack@google.com-  PLY provides full support for empty productions, error recovery,
2512855Sgabeblack@google.com   precedence rules, and ambiguous grammars.
2612855Sgabeblack@google.com
2712855Sgabeblack@google.com-  Parsing is based on LR-parsing which is fast, memory efficient,
2812855Sgabeblack@google.com   better suited to large grammars, and which has a number of nice
2912855Sgabeblack@google.com   properties when dealing with syntax errors and other parsing 
3012855Sgabeblack@google.com   problems. Currently, PLY can build its parsing tables using 
3112855Sgabeblack@google.com   either SLR or LALR(1) algorithms. 
3212855Sgabeblack@google.com
3312855Sgabeblack@google.comMore information about PLY can be obtained on the PLY webpage at:
3412855Sgabeblack@google.com
3512855Sgabeblack@google.com                   http://www.dabeaz.com/ply
3612855Sgabeblack@google.com
3712855Sgabeblack@google.comPLY is freely available.
3812855Sgabeblack@google.com
3912855Sgabeblack@google.comCheers,
4012855Sgabeblack@google.com
4112855Sgabeblack@google.comDavid Beazley (http://www.dabeaz.com)