#include #include #include #define COUNT 10 using namespace std; string matrix[30][3]; int Priority(char operateur); struct Node { char data; bool var; Node *left, *right; Node(char data) { this->data = data; this->var=NULL; this->left = this->right = nullptr; }; Node(char data, Node *left, Node *right,bool var) { this->var=var; this->data = data; this->left = left; this->right = right; }; }; //Make sure the character it's connecteur bool isConnecteur(char c) { return (c == '&' || c == '~' || c == '#' || c == '|' || c == '>'); } //building tree by giving postfix Node* construct(string postfix) { if (postfix.length() == 0) { return nullptr; } stack s; for (char c: postfix) { if (isConnecteur(c)) { if(c=='~'){ Node* right = s.top(); s.pop(); Node* node = new Node(c, nullptr, right,NULL); s.push(node); }else{ Node* right = s.top(); s.pop(); Node* left = s.top(); s.pop(); Node* node = new Node(c, left, right,NULL); s.push(node); } } else { s.push(new Node(c)); } cout< stk; string output = ""; for (int i = 0; i < exp.length(); i++){ if (exp[i] == ' ') continue; if (isalpha(exp[i])) output += exp[i]; else if (exp[i] == '('){ stk.push('('); cout << "add :" <data)) { cout<data<<" ---> "; bool b ; cin>>b; root->var = b; } value(root->left); value(root->right); } } int Priority(char connecteur){ if (connecteur == '#' || connecteur == '>') return 1; else if (connecteur == '|') return 2; else if (connecteur == '&') return 3; else if (connecteur == '~') return 4; else return 0; } bool evaluatepostfix(Node* root) { if(root->left==NULL&&root->right==NULL) return root->var; else{ bool ret; if(root->data=='~'){ bool l=evaluatepostfix(root->right); ret=!l; } if(root->data=='&'){ bool l=evaluatepostfix(root->left); bool r=evaluatepostfix(root->right); ret=l&r; } if(root->data=='|'){ bool l=evaluatepostfix(root->left); bool r=evaluatepostfix(root->right); ret=l|r; } if(root->data=='>'){ bool l=evaluatepostfix(root->left); bool r=evaluatepostfix(root->right); if(l && !r ) ret=false; else ret=true; } if(root->data=='#'){ bool l=evaluatepostfix(root->left); bool r=evaluatepostfix(root->right); ret=(!l|r)&(!r|l); } return ret; } } void print_tree(Node *root, int spaces) { if(root != NULL) { print_tree(root->right, spaces + 4); for(int i = 0; i < spaces; i++) cout <<' '; cout << "___" << root->data << endl; print_tree(root->left, spaces + 4); } } int main() { cout<<"---------------------Start Of Program--------------------"<> infixExpression; cout << "Steps :" << endl; postfixExpression=infix_to_postfix(infixExpression); cout <<"infix :"<

tplogique

Code examples by languages