求命题真值表及主范式

#include "iostream"
#include "cstring"
#include "cstdlib"
#include "stack"
#include "cmath"
#define maxsize 100
using namespace std;
char str[100];
int  zhipai[20]={0};
int length;
char expression[100];
class symbol {
public:
    void solve();
private:
    void change();    
    int Calculate();
    void DoOperator(char op);
    stack<int> s;        
};

void symbol ::DoOperator(char op){                       
    double left=0,right=0;
        switch(op){
        case '|':s.push(left||right);break;
        case '&':s.push(left&&right);break;
        case '>':s.push(!left||right);break;
        case '!':s.push((!right)&&left);break;
        case '=':s.push(left==right);break;
        }
    
}
void symbol ::change()  
{
    int k=0;                             
    int flag=1;                         
    int count=0;                        
    for(int i=0;i<pow(2.0,count);i++)
    {
        k=1;
        for(int m=0;m<length;m++)
        {
            if(isalpha(str[m]))
            {
                if(flag==1)
                {
                if(zhipai[k]==0)
                    expression[m]='0';
                else
                    expression[m]='1';
                k++;
                }
                else
                    expression[m]='0';
                flag=1;
                for(int t=m;t>=0;t--)
                {

                    if((str[m+1]==str[t])&&isalpha(str[m+1])&&isalpha(str[t]))
                        flag=0;
                }
            }
            else
                expression[m]=str[m];
        }
        for(int t=0;t<length;t++)
        {
            for(int j=t;j<length;j++)
            {
                    if(str[t]==str[j])
                    {
                        expression[j]=expression[t];
                    }
                }
        }
    }
}
void plus(int a[],int q)
{
    a[q]=a[q]+1;
    for(int i=q;a[i]==2;i--)
    {    
        a[i]=0;
        a[i-1]=a[i-1]+1;
    }
}
int isp(char ch)     //联结词的栈内优先级
{
    switch(ch){
    case '#':return 0;break;
    case '(':return 1;break;
    case '!':return 10;break;
    case '=':return 9;break;
    case '&':return 7;break;
    case '|':return 5;break;
    case '>':return 3;break;
    case ')':return 12;break;
    default:return -1;break;
    }
}
int icp(char ch)     //联结词的栈外优先级
{
    switch(ch){
    case '#':return 0;break;
    case '(':return 12;break;
    case '!':return 11;break;
    case '=':return 8;break;
    case '&':return 6;break;
    case '|':return 4;break;
    case '>':return 2;break;
    case ')':return 1;break;
    default:return -1;break;
    }
}
int symbol ::Calculate()               
{
    stack<char> h;
    char ch,y;
    h.push('#');
    for(int temp=0;temp<length-1;temp++){
        ch=expression[temp];
        if(isdigit(ch))
        {
            if(ch=='0')
            s.push(0);
            else
                s.push(1);
        }
        else if(ch==')')
        {
            for(y=h.top(),h.pop();y!='(';y=h.top(),h.pop()){
                DoOperator(y);}
        }
        else{
            if(ch=='!')
            {
                s.push(1);
            }
            for(y=h.top(),h.pop();isp(y)>icp(ch);y=h.top(),h.pop())
                DoOperator(y);
            h.push(y);
            h.push(ch);
        }
    }
    while(h.size()!=1){
        y=h.top();
        h.pop();
        DoOperator(y);    
    }
    cout <<s.top()<<endl;
    return s.top();
}

void symbol::solve()
{
    cout<<"请输入命题逻辑表达式："<<endl;
    cout<<"（|:或运算，&:与运算，!非运算，>蕴涵运算，=等价运算，以#结尾）"<<endl;
    cout<<""<<endl;
    int flag=1;                   
    int count=0;                     
    cin >>str;  
    length=strlen(str);    
    if(str[length-1]!='#')
    {
        cout<<"未以#结尾,重新输入!"<<endl;
        system("pause");
        exit(0);
    }
    char bianyuan[100];                            
    for(int i=0;i<length;i++)
    {
        if(isalpha(str[i])&&(flag==1))
        {
            bianyuan[count]=str[i];count++;
        }
        flag=1;
        for(int k=0;k<count;k++)
        {
            if(bianyuan[k]==str[i+1])flag=0;
        }        
    }    
    if(count==0)
    {
        cout<<"无命题变元,重新输入!"<<endl;
        solve();
    }
    cout<<"真值表(用0代替F,用1代替T):" <<endl;
    
    for(int w=0;w<count;w++)
    cout<<bianyuan[w]<<' ';
    cout<<"result"<<endl;
    int* truth=new int[pow(2.0,count)];
    stack<char> xh1;
    xh1.push('(');
    stack<char> xh2;
    stack<char> hx1;
    hx1.push('(');
    stack<char> hx2;
    for(int r=0;r<pow(2.0,count);r++)
    {
        for(int j=1;j<=count;j++)
        {cout<<zhipai[j]<<' ';}
        change(); 
        truth[r]=Calculate(); 
        if(truth[r]==1)    
        {
            for(int t=0;t<count;t++)
            {
                if(zhipai[t+1]==1)
                {
                    xh1.push(bianyuan[t]);
                    xh1.push('&');
                }
                else
                {
                    xh1.push('!');
                    xh1.push(bianyuan[t]);
                    xh1.push('&');
                }
            }
            xh1.pop();
            xh1.push(')');
            xh1.push('|');
            xh1.push('(');
        }
        if(truth[r]==0)                
        {
            for(int c=0;c<count;c++)
            {
                if(zhipai[c+1]==1)
                {
                    hx1.push(bianyuan[c]);
                    hx1.push('|');
                }
                else
                {
                    hx1.push('!');
                    hx1.push(bianyuan[c]);
                    hx1.push('|');
                }
            }
            hx1.pop();
            hx1.push(')');
            hx1.push('&');
            hx1.push('(');
        }
        plus(zhipai,count);
    }
    cout<<"析合范式为:";
    if(xh1.size()==1)
        cout<<"无析合范式,此表达式为矛盾式";
    else{
        xh1.pop();
        xh1.pop();
        while(xh1.size()!=0)
        {
            xh2.push(xh1.top());
            xh1.pop();
        }
        while(xh2.size()!=0)
        {
            cout<<xh2.top();
            xh2.pop();
        }
    }
    cout<<endl;
    cout<<"合析范式为:";
    if(hx1.size()==1)
        cout<<"无合析范式,此表达式为重言式";
    else{
        hx1.pop();
        hx1.pop();
        while(hx1.size()!=0)
        {
            hx2.push(hx1.top());
            hx1.pop();
        }
        while(hx2.size()!=0)
        {
            cout<<hx2.top();
            hx2.pop();
        }
    }
    cout<<endl;    
}
void main()
{
    
    symbol a;
    a.solve();
    system("pause");
}