Corrected the positions of example tags

Author: janmenjayap

src/sage/sets/recursively_enumerated_set.pyx

@@ -20,6 +20,8 @@ AUTHORS:
 
 - Sébastien Labbé, April 2014, at Sage Days 57, Cernay-la-ville
 
+EXAMPLES:
+
 No hypothesis on the structure
 ------------------------------
 
@@ -28,8 +30,6 @@ to be a forest, symmetric, or graded. However, it may have other
 structure, such as not containing an oriented cycle, that does not
 help with the enumeration.
 
-EXAMPLES:
-
 In this example, the seed is 0 and the successor function is either ``+2``
 or ``+3``. This is the set of non negative linear combinations of 2 and 3::
 
@@ -55,9 +55,7 @@ Symmetric structure
 
 The origin ``(0, 0)`` as seed and the upper, lower, left and right lattice
 point as successor function. This function is symmetric since `p` is a
-successor of `q` if and only if `q` is a successor or `p`:
-
-EXAMPLES::
+successor of `q` if and only if `q` is a successor or `p`::
 
     sage: succ = lambda a: [(a[0]-1,a[1]), (a[0],a[1]-1), (a[0]+1,a[1]), (a[0],a[1]+1)]
     sage: seeds = [(0,0)]
@@ -92,9 +90,7 @@ Graded structure
 ----------------
 
 Identity permutation as seed and ``permutohedron_succ`` as successor
-function:
-
-EXAMPLES::
+function::
 
     sage: succ = attrcall("permutohedron_succ")
     sage: seed = [Permutation([1..5])]
@@ -144,7 +140,7 @@ Graded components (set of elements of the same depth)::
 Forest structure
 ----------------
 
-EXAMPLES:
+.. RUBRIC:: Forest structure [Ex 1]
 
 The set of words over the alphabet `\{a,b\}` can be generated from the
 empty word by appending the letter `a` or `b` as a successor function. This set
@@ -168,7 +164,7 @@ Breadth first search iterator::
     sage: [next(it) for _ in range(6)]
     ['', 'a', 'b', 'aa', 'ab', 'ba']
 
-The following example of Forest structure was provided by Florent Hivert.
+This example was provided by Florent Hivert.
 
 How to define a set using those classes?
 
@@ -234,7 +230,9 @@ or::
     sage: S.list()
     ['', 'a', 'aa', 'ab', 'ac', 'b', 'ba', 'bb', 'bc', 'c', 'ca', 'cb', 'cc']
 
-The following example of Forest structure was provided by Florent Hivert.
+.. RUBRIC:: Forest structure [Ex 2]
+
+This example was provided by Florent Hivert.
 
 Here is a little more involved example. We want to iterate through all
 permutations of a given set `S`. One solution is to take elements of `S` one
@@ -1692,8 +1690,6 @@ class RecursivelyEnumeratedSet_forest(Parent):
     recover the corresponding integers, and discard tuples finishing
     by zero.
 
-    EXAMPLES:
-    
     A first approach is to pass the ``roots`` and ``children``
     functions as arguments to :meth:`RecursivelyEnumeratedSet_forest.__init__`::