Modernize Python 2 code to get ready for Python 3

06-code-golf/tf-06-1.py

@@ -1,8 +1,9 @@
 #!/usr/bin/env python
+from __future__ import print_function
 import re, string, sys
 
 stops = set(open("../stop_words.txt").read().split(",") + list(string.ascii_lowercase))
 words = [x.lower() for x in re.split("[^a-zA-Z]+", open(sys.argv[1]).read()) if len(x) > 0 and x.lower() not in stops]
 unique_words = list(set(words))
-unique_words.sort(lambda x, y: cmp(words.count(y), words.count(x)))
-print "\n".join(["%s - %s" % (x, words.count(x)) for x in unique_words[:25]])
+unique_words.sort(key=lambda x: words.count(x), reverse=True)
+print("\n".join(["%s - %s" % (x, words.count(x)) for x in unique_words[:25]]))

06-code-golf/tf-06-bm.py

@@ -1 +1,3 @@
+from __future__ import print_function
+from functools import reduce
 print (reduce(lambda string, tup: string + tup[0] + ' - ' + str(tup[1]) + '\n', sorted( filter(lambda tup: tup[0] not in open(__import__('os').path.join(__import__('os').path.dirname(__file__), '..', 'stop_words.txt')).read().lower().split(','),  reduce(lambda word_dict, word: word_dict if (word_dict.__setitem__(word, word_dict.get(word, 0) + 1) if True else None) else word_dict, filter(lambda word: len(word) > 1, (''.join(map(lambda letter: ' ' if ord(letter) not in set(range(ord('a'), ord('z') + 1)) else letter, open(__import__('sys').argv[1]).read().lower()))).split()), {}).iteritems()), key=lambda tup: tup[1], reverse=True)[0:25], '')) # hole in one?

06-code-golf/tf-06-pn.py

@@ -2,10 +2,11 @@
 # My golf score is slightly lower!  
 # Best wishes, Peter Norvig
 
+from __future__ import print_function
 import re, sys, collections
 
 stopwords = set(open('../stop_words.txt').read().split(','))
 words = re.findall('[a-z]{2,}', open(sys.argv[1]).read().lower())
 counts = collections.Counter(w for w in words if w not in stopwords)
 for (w, c) in counts.most_common(25):
-    print w, '-', c
+    print(w, '-', c)

06-code-golf/tf-06.py

@@ -1,6 +1,7 @@
 #!/usr/bin/env python
+from __future__ import print_function
 import heapq, re, sys
 
 words = re.findall("[a-z]{2,}", open(sys.argv[1]).read().lower())
 for w in heapq.nlargest(25, set(words) - set(open("../stop_words.txt").read().split(",")), words.count):
-    print w, "-", words.count(w)
+    print(w, "-", words.count(w))