Here's a simple Python program that checks if the parentheses match using a stack data structure:

```python
def is_balanced(s):
stack = []
parentheses = {')': '(', '}': '{', ']': '['}

for char in s:
if char in parentheses.values():
stack.append(char)
elif char in parentheses.keys():
if not stack or stack.pop() != parentheses[char]:
return False

return len(stack) == 0

# Example usage
input_string = "((()))" # Change this string to test other cases
result = is_balanced(input_string)
print(result) # Output: True or False

```python
class StackVM:
def __init__(self):
self.stack = []

def push(self, value):
self.stack.append(value)

def pop(self):
if not self.stack:
raise IndexError("Pop from empty stack")
return self.stack.pop()

def add(self):
b = self.pop()
a = self.pop()
self.push(a + b)

def subtract(self):
b = self.pop()
a = self.pop()
self.push(a - b)

def multiply(self):
b = self.pop()
a = self.pop()
self.push(a * b)

def divide(self):
b = self.pop()
a = self.pop()
if b == 0:
raise ZeroDivisionError("Division by zero")