Question: Create a recursive descent parser for boolean formulas in python without import with the following conditions: variables can be a-z ~ will represent not and
Create a recursive descent parser for boolean formulas in python without import with the following conditions:
variables can be a-z
~ will represent not and will be in a unary tree class(nott)
+ will represent and and will be in a binary tree class(andt)
* will represent or and will be in a binary tree class(ort)
formulas may have brackets
example below:
def make_tree("~x + y") returns >>> andt(leaf(nott(x),leaf(y))
picture of tree also attached : https://imgur.com/a/Zpgnz
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
