Documentation: Syntax highlight & test python examples

README

@@ -109,17 +109,17 @@ rules and provide new ones. Grammar rules are exposed as methods.
 Example Usage
 -------------
 
-::
-
-    from parsley import makeGrammar
-    exampleGrammar = """
-    ones = '1' '1' -> 1
-    twos = '2' '2' -> 2
-    stuff = (ones | twos)+
-    """
-    Example = makeGrammar(exampleGrammar, {})
-    g = Example("11221111")
-    result = g.stuff()
-    print result
-
-→  ``[1, 2, 1, 1]``
+.. code:: python
+
+    >>> from parsley import makeGrammar
+    >>> exampleGrammar = """
+    ... ones = '1' '1' -> 1
+    ... twos = '2' '2' -> 2
+    ... stuff = (ones | twos)+
+    ... """
+
+    >>> Example = makeGrammar(exampleGrammar, {})
+    >>> g = Example("11221111")
+    >>> g.stuff()
+    [1, 2, 1, 1]
+

doc/extending.rst

@@ -7,7 +7,9 @@ Extending Grammars and Inheritance
 Another feature taken from OMeta is *grammar inheritance*. We can
 write a grammar with rules that override ones in a parent. If we load
 the grammar from our calculator tutorial as ``Calc``, we can extend it
-with some constants::
+with some constants:
+
+.. code:: python
 
     from parsley import makeGrammar
     import math

doc/terml.rst

@@ -10,15 +10,15 @@ trees.
 Creating Terms
 ==============
 
-::
+.. code:: python
 
     >>> from terml.nodes import termMaker as t
     >>> t.Term()
     term('Term')
 
 That's it! We've created an empty term, `Term`, with nothing inside.
 
-::
+.. code:: python
 
     >>> t.Num(1)
     term('Num(1)')