/usr/lib/pypy/dist-packages/rply-0.7.2.egg-info is in pypy-rply 0.7.2-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
| 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 | Metadata-Version: 1.0
Name: rply
Version: 0.7.2
Summary: A pure Python Lex/Yacc that works with RPython
Home-page: UNKNOWN
Author: Alex Gaynor
Author-email: alex.gaynor@gmail.com
License: UNKNOWN
Description: RPLY
        ====
        
        .. image:: https://secure.travis-ci.org/alex/rply.png
            :target: http://travis-ci.org/alex/rply
        
        Welcome to RPLY! A pure python parser generator, that also works with RPython.
        It is a more-or-less direct port of David Beazley's awesome PLY, with a new
        public API, and RPython support.
        
        Basic API:
        
        .. code:: python
        
            from rply import ParserGenerator, LexerGenerator
            from rply.token import BaseBox
        
            lg = LexerGenerator()
            # Add takes a rule name, and a regular expression that defines the rule.
            lg.add("PLUS", r"\+")
            lg.add("MINUS", r"-")
            lg.add("NUMBER", r"\d+")
        
            lg.ignore(r"\s+")
        
            # This is a list of the token names. precedence is an optional list of
            # tuples which specifies order of operation for avoiding ambiguity.
            # precedence must be one of "left", "right", "nonassoc".
            # cache_id is an optional string which specifies an ID to use for
            # caching. It should *always* be safe to use caching,
            # RPly will automatically detect when your grammar is
            # changed and refresh the cache for you.
            pg = ParserGenerator(["NUMBER", "PLUS", "MINUS"],
                    precedence=[("left", ['PLUS', 'MINUS'])], cache_id="myparser")
        
            @pg.production("main : expr")
            def main(p):
                # p is a list, of each of the pieces on the right hand side of the
                # grammar rule
                return p[0]
        
            @pg.production("expr : expr PLUS expr")
            @pg.production("expr : expr MINUS expr")
            def expr_op(p):
                lhs = p[0].getint()
                rhs = p[2].getint()
                if p[1].gettokentype() == "PLUS":
                    return BoxInt(lhs + rhs)
                elif p[1].gettokentype() == "MINUS":
                    return BoxInt(lhs - rhs)
                else:
                    raise AssertionError("This is impossible, abort the time machine!")
        
            @pg.production("expr : NUMBER")
            def expr_num(p):
                return BoxInt(int(p[0].getstr()))
        
            lexer = lg.build()
            parser = pg.build()
        
            class BoxInt(BaseBox):
                def __init__(self, value):
                    self.value = value
        
                def getint(self):
                    return self.value
        
        Then you can do:
        
        .. code:: python
        
            parser.parse(lexer.lex("1 + 3 - 2+12-32"))
        
        You can also substitute your own lexer. A lexer is an object with a ``next()``
        method that returns either the next token in sequence, or ``None`` if the token
        stream has been exhausted.
        
        Why do we have the boxes?
        -------------------------
        
        In RPython, like other statically typed languages, a variable must have a
        specific type, we take advantage of polymorphism to keep values in a box so
        that everything is statically typed. You can write whatever boxes you need for
        your project.
        
        If you don't intend to use your parser from RPython, and just want a cool pure
        Python parser you can ignore all the box stuff and just return whatever you
        like from each production method.
        
        Error handling
        --------------
        
        By default, when a parsing error is encountered, an ``rply.ParsingError`` is
        raised, it has a method ``getsourcepos()``, which returns an
        ``rply.token.SourcePosition`` object.
        
        You may also provide an error handler, which, at the moment, must raise an
        exception. It receives the ``Token`` object that the parser errored on.
        
        .. code:: python
        
            pg = ParserGenerator(...)
        
            @pg.error
            def error_handler(token):
                raise ValueError("Ran into a %s where it wasn't expected" % token.gettokentype())
        
        Python compatibility
        --------------------
        
        RPly is tested and known to work under Python 2.6, 2.7, 3.1, and 3.2. It is
        also valid RPython for PyPy checkouts from ``6c642ae7a0ea`` onwards.
        
        Links
        -----
        
        * `Source code and issue tracker <https://github.com/alex/rply/>`_
        * `PyPI releases <https://pypi.python.org/pypi/rply>`_
        * `Talk at PyCon US 2013: So you want to write an interpreter? <http://pyvideo.org/video/1694/so-you-want-to-write-an-interpreter>`_
        
Platform: UNKNOWN
 |