def diveby2(decNumber):
remstack = Stack()
while decNumber > 0:
rem = decNumber %2
remstack.push(rem)
decNumber = decNumber //2
binString = ''
while not remstack.isEmpty():
binString = binString+str(remstack.pop())
return binString
def to_binary(num):
s = Stack()
while num > 0:
reminder = num % 2
s.push(reminder)
num = num // 2
bin_num = ""
while not s.is_empty():
bin_num += str(s.pop())
return bin_num
def par_checker(symbol_string):
s = Stack()
balanced = True
index = 0
while index < len(symbol_string) and balanced:
symbol = symbol_string[index]
if symbol == "(":
s.push(symbol)
else:
if s.is_empty():
balanced = False
else:
s.pop()
index = index + 1
if balanced and s.is_empty():
return True
else:
return False
def diveby2(decNumber):
remstack = Stack()
while decNumber > 0:
rem = decNumber % 2
remstack.push(rem)
decNumber = decNumber // 2
binString = ''
while not remstack.isEmpty():
binString = binString + str(remstack.pop())
return binString
def divide_by_2(dec_number):
rem_stack = Stack()
while dec_number > 0:
rem = dec_number % 2
rem_stack.push(rem)
dec_number = dec_number // 2
bin_string = ""
while not rem_stack.is_empty():
bin_string = bin_string + str(rem_stack.pop())
return bin_string
def is_parentesis_balanced(str):
s = Stack()
is_balanced = True
index = 0
while index < len(str) and is_balanced:
parethesis = str[index]
if parethesis in "{[(":
s.push(parethesis)
else:
if s.is_empty():
is_balanced = False
else:
top = s.pop()
if not is_match(top, parethesis):
is_balanced = False
index = index + 1
return s.is_empty() and is_balanced
def base_converter(dec_number, base):
digits = "0123456789ABCDEF"
rem_stack = Stack()
while dec_number > 0:
rem = dec_number % base
rem_stack.push(rem)
dec_number = dec_number // base
new_string = ""
while not rem_stack.is_empty():
new_string = new_string + digits[rem_stack.pop()]
return new_string
def paracherker(symbolString):
s = Stack()
balanced = True
index = 0
while index < len(symbolString) and balanced :
symbol = symbolString[index]
if symbol == "(":
s.push(symbol)
else:
if s.isEmpty():
balanced = False
else:
s.pop()
index = index + 1
if balanced and s.isEmpty():
return True
else:
return False
def par_checker_extended(symbol_string):
s = Stack()
balanced = True
index = 0
while index < len(symbol_string) and balanced:
symbol = symbol_string[index]
if symbol in "({[":
s.push(symbol)
else:
if s.is_empty():
balanced = False
else:
top = s.pop()
if not matches(top, symbol):
balanced = False
index = index + 1
if balanced and s.is_empty():
return True
else:
return False
def paraChecker(symbolString):
s = Stack()
index = 0
balanced = True
while index < len(symbolString) and balanced:
symbol = symbolString[index]
if symbol in '([{':
s.push(symbol)
else:
if s.isEmpty():
balanced = False
else:
top = s.pop()
if not chekcer(top, symbol):
balanced = False
index += 1
if balanced and s.isEmpty():
return True
else:
return False
def paraChecker(symbolString):
s = Stack()
index = 0
balanced = True
while index < len(symbolString) and balanced :
symbol = symbolString[index]
if symbol in '([{':
s.push(symbol)
else:
if s.isEmpty():
balanced = False
else:
top = s.pop()
if not chekcer(top,symbol):
balanced = False
index +=1
if balanced and s.isEmpty():
return True
else:
return False