changed PEP references from "pep-XXXX.txt" to "PEP XXXX", so they get turned into links; removed some redundant links (reported by Martin Thomas)

pep-0003.txt

@@ -30,7 +30,7 @@ Guidelines
        find out, say, what all the open Tkinter bugs are.
 
     2. If it's a minor feature request that you don't plan to address
-       right away, add it to PEP 42[2] or ask the owner to add it for
+       right away, add it to PEP 42 or ask the owner to add it for
        you.  If you add the bug to PEP 42, mark the bug as "feature
        request", "later", and "closed"; and add a comment to the bug
        saying that this is the case (mentioning the PEP explicitly).
@@ -62,4 +62,3 @@ Guidelines
 References
 
     [1] http://sourceforge.net/projects/python
-    [2] pep-0042.txt

pep-0042.txt

@@ -15,7 +15,7 @@ Introduction
     should not be included here, but should be described in separate
     PEPs; however a large feature request that doesn't have its own
     PEP can be listed here until its own PEP is created.  See
-    pep-0000.txt for details.
+    PEP 0 for details.
 
     This PEP was created to allow us to close bug reports that are really
     feature requests.  Marked as Open, they distract from the list of real

pep-0201.txt

@@ -89,7 +89,7 @@ Lockstep For-Loops
     something in Python and changing the meanings would break existing
     code.  All other suggestions for new syntax suffered the same
     problem, or were in conflict with other another proposed feature
-    called `list comprehensions' (see pep-0202.txt).
+    called `list comprehensions' (see PEP 202).
 
 The Proposed Solution
 

pep-0204.txt

@@ -287,7 +287,7 @@ Copyright
 References:
 
     [1] http://sourceforge.net/patch/?func=detailpatch&patch_id=100902&group_id=5470
-    [2] PEP 202, List Comprehensions, pep-0202.txt
+    [2] PEP 202, List Comprehensions
 
 
 

pep-0212.txt

@@ -153,7 +153,7 @@ Copyright
 References
 
     [1] http://www.python.org/doc/current/ref/for.html
-    [2] Lockstep Iteration, pep-0201.txt
+    [2] Lockstep Iteration, PEP 201
     [3] http://sourceforge.net/patch/download.php?id=101138
     [4] http://sourceforge.net/patch/download.php?id=101129
     [5] http://sourceforge.net/patch/download.php?id=101178

pep-0326.txt

@@ -140,7 +140,7 @@ Below is an example of Dijkstra's shortest path algorithm on a graph
 with weighted edges using a table (a faster version that uses a heap
 is available, but this version is offered due to its similarity to the
 description above, the heap version is available via older versions of
-this document through CVS [10]_). ::
+this document). ::
 
     def DijkstraSP_table(graph, S, T):
         table = {}                                                 #3
@@ -463,9 +463,6 @@ References
    [Python-Dev] Re: PEP 326 now online, Carlson, Josiah
    (http://mail.python.org/pipermail/python-dev/2004-January/042272.html)
 
-.. [10] PEP-0326 CVS, Carlson, Josiah
-   (http://cvs.sourceforge.net/viewcvs.py/python/python/nondist/peps/pep-0326.txt)
-
 .. [11] [Python-Dev] PEP 326 (quick location possibility), Carlson, Josiah
    (http://mail.python.org/pipermail/python-dev/2004-January/042275.html)