Reblok build an Abstract Syntax Tree (AST) from python bytecode
Example:
>>> from reblok import Parser
>>> add = lambda x: x + 1
>>> print Parser().walk(add)
['function', '<lambda>', [['ret', ('add', ('var', 'x', 'local'), ('const', 1))]], [('x', '<undef>')], None, None, [], {}]
1 maintainer
Release files for reblok 0.1.3
For a detailed explanation of source distributions (sdists) and built distributions (wheels), please see the package formats documentation.
Source distribution (sdist)
| File | Size | Uploaded | |
|---|---|---|---|
| reblok-0.1.3.tar.gz | 51.4 kB | Details |
Release files / reblok-0.1.3.tar.gz
| Download URL | reblok-0.1.3.tar.gz |
|---|---|
| Size | 51.4 kB |
| Tags | Source |
|
SHA-256 checksum How to use checksums |
7b4991d908e7ced14b816ab9eb837dde0a1ac4d481865fea679673676bd615bd
|
|
BLAKE2b-256 checksum How to use checksums |
76f6118662688ac5e247dd6a94e983a8f491adb57d76e068b27b246847b17901
|
| Upload date | |
|
Uploaded using Trusted Publishing? What is trusted publishing? |
No |
