Docs - more on project status

Author: spookylukey

README.rst

@@ -11,14 +11,22 @@ monadic parser combinator library for LL(infinity) grammars in the spirit of
 <https://github.com/jneen/parsimmon>`_. But don't worry, it has really good
 documentation and it doesn't say things like that!
 
-Parsy requires Python 3.7 or greater.
-
 For a good example of the kind of clear, declarative code you can create using
 parsy, see the `SQL SELECT statement example
 <https://parsy.readthedocs.io/en/latest/howto/other_examples.html#sql-select-statement-parser>`_
 or `JSON parser
 <https://parsy.readthedocs.io/en/latest/howto/other_examples.html#json-parser>`_.
 
+The project:
+
+- has **zero dependencies** outside stdlib.
+- is **highly mature and stable**, with few-to-none backwards incompatibilities
+  over the past 10 years.
+- is **essentially complete**, with no rewrites planned. Widely useful
+  improvements that don’t break compatibility will still be considered, however.
+- is implemented in a single module with less than 800LOC, which you could
+  vendor easily if required.
+
 Links:
 
 - `Documentation <http://parsy.readthedocs.io/en/latest/>`_

docs/overview.rst

@@ -40,6 +40,10 @@ Parsy differentiates itself from other solutions with the following:
 * it has a minimalist philosophy. It doesn't include built-in helpers for any
   specific grammars or languages, but provides building blocks for making these.
 
+* it is highly mature and stable, with no rewrites planned and an excellent
+  reputation for backwards compatibility, while modernising and keeping up with
+  latest Python idioms everywhere that is possible.
+
 Basic usage looks like this:
 
 Example 1 - parsing a set of alternatives: