[Date Prev][Date Next] [Thread Prev][Thread Next] [Date Index] [Thread Index]

Bug#781870: marked as done (ITP: ply -- Python implementation of the common parsing tools lex and yacc)



Your message dated Fri, 03 Apr 2015 23:52:49 -0400
with message-id <3894484.Rub3INl72I@kitterma-e6430>
and subject line Already Packaged
has caused the Debian Bug report #781870,
regarding ITP: ply -- Python implementation of the common parsing tools lex and yacc
to be marked as done.

This means that you claim that the problem has been dealt with.
If this is not the case it is now your responsibility to reopen the
Bug report if necessary, and/or fix the problem forthwith.

(NB: If you are a system administrator and have no idea what this
message is talking about, this may indicate a serious mail system
misconfiguration somewhere. Please contact owner@bugs.debian.org
immediately.)


-- 
781870: http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=781870
Debian Bug Tracking System
Contact owner@bugs.debian.org with problems
--- Begin Message ---
Package: wnpp
Severity: wishlist
Owner: Scott Kitterman <debian@kitterman.com>

* Package name    : ply
  Version         : 3.4
  Upstream Author : David M. Beazley (Dabeaz LLC)
* URL             : http://www.dabeaz.com/ply/
* License         : BSD
  Programming Lang: Python
  Description     : Python implementation of the common parsing tools lex and yacc

 python-ply is a 100% Python implementation of the common parsing tools lex and
 yacc. Here are a few highlights:
 .
  * very closely modeled after traditional lex/yacc.
 .
  * provides *very* extensive error reporting and diagnostic information to
    assist in parser construction.
 .
  * provides full support for empty productions, error recovery, precedence
    specifiers, and moderately ambiguous grammars.
 .
  * based on LR-parsing which is fast, memory efficient, better suited to large
    grammars, and has a number of nice properties when dealing with syntax
    errors and other parsing problems. Builds its parsing tables using the LALR
    algorithm used in yacc.
 .
  * uses Python introspection features to build lexers and parsers. This greatly
    simplifies the task of parser construction since it reduces the number of
    files and eliminates the need to run a separate lex/yacc tool before running
    your program.
 .
  * can be used to build parsers for "real" programming languages. Athough not
    ultra-fast due to its Python implementation, can be used to parse grammars
    consisting of several hundred rules (as might be found for a language like
    C). The lexer and LR parser are also reasonably efficient when parsing
    typically sized programs.

The package will be maintained in the DPMT.  It is a dependency of another
package I plan to upload.  If anyone else is interested in this, please let me
know and I'll add you to uploaders.

It supports (and will be packaged for) both python and python3.

--- End Message ---
--- Begin Message ---
Nevermind.

Already in the archive.

Scott K

--- End Message ---

Reply to: