利用真值表法求取主析取范式以及主合取范式的实现副本.doc

#include stdio.h#include stdlib.h#include string.h#include math.h#define N 50void pd(int bN,int f);int H1 (char T1N, char T2N, int T3N, int y);int H2 (char T1N, char T2N, int T3N, int y);int main() int i1,i2,d=1,T3N,kh=0,jg,j=0,y; int w=0,hequN,h=0,x=0,xiquN; char T1N,T2N,T10N,s; hequ0=-1; xiqu0=-1; printf(#n); printf(# 用!表示否定 #n); printf(# 用&表示合取 #n); printf(# 用|表示析取 #n); printf(# 用表示条件 #n); printf(# 用表示双条件 #n); printf(#nn); printf(请输入一个合法的命题公式:n); gets(T1); strcpy(T10,T1); for(i1=0;i1=a & T1i1=A & T1i1=Z) for(i2=0;i2j;i2+) if(T2i2=T1i1) d=0; if(d=1) T2j=T1i1; j+; d=1; printf(n输出真值表如下：n n); for(i1=0;i1y;i1+) printf( %c ,T2i1); printf( ); puts(T1); printf(n); for(i1=0;i1j;i1+) T3i1=0; for(i2=0;i2j;i2+) printf( %d ,T3i2); jg=H1(T1,T2,T3,y); if(jg=0) hequh+=w; else xiqux+=w; printf( %dn,jg); strcpy(T1,T10); for(i1=0;i1(int)pow(2,j)-1;i1+) +w; pd(T3,j-1); jg=H1(T1,T2,T3,y); if(jg=0) hequh+=w; else xiqux+=w; strcpy(T1,T10); for(i2=0;i2j;i2+) printf( %d ,T3i2); printf( %dn,jg); if(hequ0=-1) printf(n该命题公式不存在主合取范式。n); else printf(n主合取范式：nt); for(i1=0;i10) printf(/); printf(M(%d),hequi1); if(xiqu0=-1) printf(n该命题公式不存在主析取范式。n); else printf(nn主析取范式：nt); for(i1=0;i10) printf(/); printf(m(%d),xiqui1); printf(n); getch();void pd(int bN,int f) int i; i=f; if(bf=0) bf=1; else bf=0; pd(b,-i); int H1 (char T1N,char T2N,int T3N,int y) int i,j,h,s,kh=0,wzN,a; char xs1N,ckhN; s=strlen(T1); for(i=0;is;i+) if(T1i=( | T1i=) wzkh=i; ckhkh=T1i; kh+; if(kh=0) return H2(T1,T2,T3,y); else for(i=0;ikh;i+) if(ckhi=) break; for(j=wzi-1+1,h=0;jwzi;j+,h+) xs1h=T1j; xs1h=0; a=H2(xs1,T2,T3,y); if(a=1) T1wzi-1=1; else T1wzi-1=-2; for(j=wzi-1+1;js+wzi-1-wzi;j+) T1j=T1j+wzi-wzi-1; T1j=0; return H1(T1,T2,T3,y); int H2(char T1N,char T2N,int T3N,int y) int i,h=0,j=0,j1=0,j2=0,j3=0,j4=0,j5=0,i1,i2,p1=-1,p2=-1,s; char dtN; s=strlen(T1); if(s=1) if(T10=-2) return 0; else return 1; else for(i=0;is-j;i+) if(T1i=!) for(i1=0;i1y;i1+) if(T1i+1=T2i1) p1=T3i1; if(T1i+1=-2) p1=0; if(p1=-1) p1=T1i+1; dtj+2=!p1; T1i=j+2; j+; p1=0; for(i1=i+1;i1s-j;i1+) T1i1=T1i1+1; p1=-1; j1=j; for(i=0;is-j1-2*j2;i+) if(T1i=&) for(i1=0;i1y;i1+) if(T1i-1=T2i1) p1=T3i1; if(T1i+1=T2i1) p2=T3i1; for(i2=2;i2j+2;i2+) if(T1i-1=i2) p1=dti2; if(T1i+1=i2) p2=dti2; if(T1i-1=-2) p1=0; if(T1i+1=-2) p2=0; if(p1=-1) p1=(int)(T1i-1); if(p2=-1) p2=(int)(T1i+1); dtj+2=p1 & p2; T1i-1=j+2; j+; j2+; p1=-1; p2=-1; for(i1=i;i1s-j1-2*j2;i1+) T1i1=T1i1+2; i=i-1; for(i=0;is-j1-2*j2-2*j3;i+) if(T1i=|) for(i1=0;i1y;i1+) if(T1i-1=T2i1) if(T1i+1=T2i1) p2=T3i1; for(i2=2;i2j+2;i2+) if(T1i-1=i2) p1=dti2; if(T1i+1=i2) p2=dti2; if(T1i-1=-2) p1=0; if(T1i+1=-2) p2=0; if(p1=-1) p1=T1i-1; if(p2=-1) p2=T1i+1; dtj+2=p1 | p2; T1i-1=j+2; j+; j3+; p1=-1; p2=-1; for(i1=i;i1s-j1-2*j2-2*j3;i1+) T1i1=T1i1+2; i-; for(i=0;is-j1-2*j2-2*j3-2*j4;i+) if(T1i=) for(i1=0;i1y;i1+) if(T1i-1=T2i1) p1=T3i1; if(T1i+1=T2i1) p2=T3i1; for(i2=2;i2j+2;i2+) if(T1i-1=i2) p1=dti2; if(T1i+1=i2) p2=dti2; if(T1i-1=-2) p1=0; if(T1i+1=-2) p2=0; if(p1=-1) p1=T1i-1; if(p2=-1) p2=T1i+1; dtj+2=!p1 | p2; T1i-1=j+2; j+; j4+; p1=-1; p2=-1; for(i1=i;i1s-j1-2*j2-2*j3-2*j4;i1+) T1i1=T1i1+2; i-; for(i=0;is-j1-2*j2-2*j3-2*j4-2*j5;i+) if(T1i=) for(i1=0;i1y;i1+) if(T1i-1=T2i1) p1=T3i1; if(T1i+1=T2i1) p2=T3i1; for(i2=2;i2j+2;i2+) if(T1i-1=i2) p1=dti2; if(T1i+1=i2) p2=dti2; if(T1i-1=-2) p1=0; if(T1i+1=-2) p2=0; if