Persisting-theory is a small python utility designed to automate data discovering and access inside a list of packages. Use case: you are building an application that will have pluggable components. You want to allow these components to register data so it can be accessed by any other component of your app.

Parsley, like pyparsing and ZestyParser, uses the PEG algorithm, so each expression in the grammar rules works like a Python expression. In particular, alternatives are evaluated in order, unlike table-driven parsers such as yacc, bison or PLY.

Provides an homogeneous API over the Abstract Syntax Trees of various Python versions (including Python 2 and Python 3), which itself is compatible with the standard library "ast" module API.

Collection of compile-time analyzers of Python Abstract Syntax Trees that can be used as building blocks to write static analyzers or compilers: * Ancestors: map a node to the list of its enclosing nodes * DefUseChains: map a node to the list of definition points in that node * UseDefChains: map a node to its list of potential definitions

This package contains the headers and static library files needed to build GNU Fortran applications.

This package contains the headers and static library files needed to build GNU Fortran applications.