ProbRecurse.py

def ProbRecurse(myBP,BPR,ProbRing):
    MyString = str(myBP)
    if MyString == '1': 
        return 1
    elif MyString == '0': 
        return 0
    elif MyString.find(' 1') != -1:
        return 1 - ProbRecurse(myBP + 1,BPR,ProbRing)
    elif MyString.find('+') == -1:
        return ProbRing(MyString.lower())
    else:
        kk = MyString.find(' + ')
        myPoly1 = BPR(MyString[:kk])
        myPoly2 = BPR(MyString[kk+3:])
        return ProbRecurse(myPoly1,BPR,ProbRing) + ProbRecurse(myPoly2,BPR,ProbRing) - 2*ProbRecurse(myPoly1*myPoly2,BPR,ProbRing)