Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- from string import ascii_uppercase as alphabet
- consts = ['a', 'b', 'c', 'd', 'e']
- variables = list(alphabet)
- functions = ['f', 'g', 'h', 'i', 'j',
- 'k', 'l', 'm', 'n'
- ]
- predicts = ['p', 'q', 'r', 's',
- 't', 'u', 'v', 'w',
- 'x', 'y', 'z'
- ]
- operators = ['NOT', '~', '¬',
- 'AND', '&', '∧',
- 'OR,' '|', '∨',
- 'IMPLIES', '→',
- 'IFF', '↔',
- 'XOR', '⊕'
- ]
- quantifiers = ['FORALL', '∀',
- 'EXISTS', '∃',
- ]
- symbolics = []
- # symbolics.extend(consts)
- # symbolics.extend(variables)
- symbolics.extend(functions)
- symbolics.extend(predicts)
- symbolics.extend(operators)
- symbolics.extend(quantifiers)
- def handleFunctions(function):
- pass
- def eval(expression):
- tokens = expression.replace('/', ' ').split()
- print(tokens)
- stack = []
- for token in tokens:
- pass
- # print(consts)
- # print(variables)
- # print(predicts)
- # print(operators)
- print(symbolics)
- eval('Z Z p/1 EXISTS')
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement