import re ins = str(input()) def str2BF(str): bfCode = '++++++++[' ordList = [] for p in str: ordList.append(ord(p)) indexList = [] for p in ordList: indexList.append(p//16) valList = [] for p in range(8): if p in indexList: valList.append(p) valList = sorted(valList) for p in range(len(indexList)): indexList[p] = valList.index(indexList[p]) for p in range(len(valList)): valList[p] = (valList[p]*5)//2 bfCode += '>' + '+'*valList[p] valList[p] *= 8 bfCode += '<'*len(valList) + '-]>' index = 0 for p in range(len(ordList)): move = indexList[p] - index if move>=0: bfCode += '>'*move else: bfCode += '<'*(-move) index += move add = ordList[p] - valList[index] if add>=0: bfCode += '+'*add else: bfCode += '-'*(-add) valList[index] += add bfCode += '.' return bfCode if str is not '' else '' def BF2ST(bf): st = ''.join(re.findall(r'[\+\-\>\<\[\]\,\.]',bf)) st = st.replace('+',' ').replace('-',' \t') st = st.replace('>',' \t ').replace('<',' \t\t') st = st.replace('[','\t ').replace(']','\t \t') st = st.replace(',','\t\t ').replace('.','\t\t\t') return st def ST2BF(st): bf = ''.join(re.findall(r'[ \t]',st)) res = '' lib = {' ':'+', ' \t':'-', ' \t ':'>', ' \t\t':'<', '\t ':'[', '\t \t':']', '\t\t ':',', '\t\t\t':'.'} for i in range(0,len(bf)-2,3): res += lib.get(bf[i:i+3]) return res def ST2VST(st): vst = st.replace(' ','S').replace('\t','T') return vst def VST2ST(vst): st = vst.replace('S',' ').replace('T','\t') return st def BF2str(bf): if bf == '': return '' elif re.match(r'^[\>\<\+\-\[\]\,\.]+$',bf) is None: print('Invalid Input, a brainfuck code should only contain "+-><[],."') else: x = 0 ft = '' for a in bf: if a == '[': x += 1 elif a == ']': if x ==0: ft += '[' else: x -= 1 bf = ft + bf + ']'*x #fix bracket list = [0] index = 0 outputs = '' p = 0 inputs = '' index2 = 0 if ',' in bf: inputs = str(input()) #for input string cfl = [] #for infinite loops check while p < len(bf): if bf[p] == '+': list[index] += 1 elif bf[p] == '-': if list[index] == 0: print('ERROR: value less than 0') break else: list[index] -= 1 elif bf[p] == '>': if index == len(list)-1: list.append(0) index += 1 elif bf[p] == '<': if index == 0: print('ERROR: index less than 0') break else: index -= 1 elif bf[p] == ',': if index2 < len(inputs): list[index] = ord(inputs[index2]) index2 += 1 else: print('result: '+outputs+'\nbreak due to insufficient input') break elif bf[p] == '.': if list[index] < 128: outputs += chr(list[index]) else: print('ERROR: char value over 127') break elif bf[p] == '[': cfs = '' x = 0 tempIndex = p+1 while x>=0: if bf[tempIndex]=='[': x += 1 elif bf[tempIndex]==']': x -= 1 cfs += bf[tempIndex] tempIndex += 1 if ',' not in cfs: cfl.append([p,tempIndex-1,index,list[index]]) elif bf[p] == ']': if len(cfl)>0 and cfl[-1][1]==p: if list[index] >= cfl[-1][3]: print('ERROR: infinite loop at ' + str(cfl[-1][0:2]) + ' : ' + bf[cfl[-1][0]:cfl[-1][1]+1]) break else: del cfl[-1] if list[index] > 0: x = 0 while x>=0: p -= 1 if bf[p]==']': x += 1 elif bf[p]=='[': x -= 1 p += 1 return outputs print('Input: ' + ins) bf = str2BF(ins) print('\nBrainf**k code:\n' + bf) st = BF2ST(bf) print('\nSpaces-Tabs code:\n' + st) vst = ST2VST(st) print('\nVisualized ST code:\n' + vst) bf2 = ST2BF(st) print('\nBrainf**k code again:\n' + bf2) str2 = BF2str(bf2) print('\nBack to original string: ' + str2)

Encoding and Decoding