lib/exercises-in-programming-style
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

More forthism

Browse Source
This commit is contained in:
Crista Lopes
2013-11-07 15:20:56 -08:00
parent 182f80f4b8
commit 6cf223bb07
1 changed files with 23 additions and 18 deletions
Download Patch File Download Diff File Expand all files Collapse all files

41
02-go-forth/tf-02.py
View File

@@ -18,9 +18,8 @@ heap = {}
# #
def read_file(): def read_file():
""" """
Takes a path to a file and returns the entire Takes a path to a file on the stack and places the entire
contents of the file as a string. contents of the file back on the stack.
Path to file expected to be on the stack
""" """
f = open(stack.pop()) f = open(stack.pop())
# Push the result onto the stack # Push the result onto the stack
@@ -29,9 +28,8 @@ def read_file():
def filter_chars(): def filter_chars():
""" """
Takes a string and returns a copy with all nonalphanumeric Takes data on the stack and places back a copy with all
chars replaced by white space. The data is assumed to be nonalphanumeric chars replaced by white space.
on the stack.
""" """
# This is not in style. RE is too high-level, but using it # This is not in style. RE is too high-level, but using it
# for doing this fast and short. Push the pattern onto stack # for doing this fast and short. Push the pattern onto stack
@@ -41,30 +39,35 @@ def filter_chars():
def scan(): def scan():
""" """
Takes a string and scans for words, returning Takes a string on the stack and scans for words, placing
a list of words. The data is assumed to be on the stack. the list of words back on the stack
""" """
# Push the result onto the stack. # Push the result onto the stack.
# Again, split() is too high-level for this style, but using it # Again, split() is too high-level for this style, but using
# for doing this fast and short. Left as exercise. # it for doing this fast and short. Left as exercise.
stack.append(stack.pop()[0].split()) stack.extend(stack.pop()[0].split())
def remove_stop_words(): def remove_stop_words():
""" """
Takes a list of words and returns a copy with all stop Takes a list of words on the stack and removes
words removed. The data is assumed to be on the stack. all stop words.
""" """
f = open('../stop_words.txt') f = open('../stop_words.txt')
stack.append(f.read().split(',')) stack.append(f.read().split(','))
f.close() f.close()
# add single-letter words # add single-letter words
stack[1].extend(list(string.ascii_lowercase)) stack[-1].extend(list(string.ascii_lowercase))
heap['stop_words'] = stack.pop() heap['stop_words'] = stack.pop()
# Again, this is too high-level for this style, but using it # Again, this is too high-level for this style, but using it
# for doing this fast and short. Left as exercise. # for doing this fast and short. Left as exercise.
for w in stack.pop(): heap['words'] = []
if w not in heap['stop_words']: while len(stack) > 0:
stack.append(w) if stack[-1] in heap['stop_words']:
stack.pop() # pop it and drop it
else:
heap['words'].append(stack.pop()) # pop it and store it
stack.extend(heap['words']) # Load the words onto the stack
del heap['words'] # We don't need this variable anymore
def frequencies(): def frequencies():
""" """
@@ -84,10 +87,12 @@ def frequencies():
stack.append(stack.pop() + stack.pop()) # add stack.append(stack.pop() + stack.pop()) # add
else: else:
stack.append(1) # Push 1 in stack[2] stack.append(1) # Push 1 in stack[2]
heap['word_freqs'][stack.pop()] = stack.pop() # Load the updated freq back onto the heap # Load the updated freq back onto the heap
heap['word_freqs'][stack.pop()] = stack.pop()
# Push the result onto the stack # Push the result onto the stack
stack.append(heap['word_freqs']) stack.append(heap['word_freqs'])
del heap['word_freqs'] # We dont need this variable anymore
def sort(): def sort():
""" """