离散实验1真值表

最新推荐文章于 2024-09-14 21:53:48 发布

yizhidabaie1

最新推荐文章于 2024-09-14 21:53:48 发布

阅读量471

点赞数 2

分类专栏： 1 文章标签：学习

本文链接：https://blog.csdn.net/licaigou/article/details/124169238

版权

1 专栏收录该内容

4 篇文章 1 订阅

订阅专栏

该篇博客主要探讨了布尔逻辑运算，包括'!'、'&'、'|'、'>'、'-'等操作符的使用，并展示了如何通过C++实现布尔表达式的判断。文中还涉及到了不同变量数量下的逻辑组合情况，并给出了相应的主合取式和主析取式。通过示例代码解释了逻辑运算在实际问题中的应用。

摘要由CSDN通过智能技术生成

南邮的好小子嗷别老惦记着抄把你宿舍号留下我改天提几箱牛奶去看你啊！

#include<iostream>
#include<cmath>
#include<cstring>
using namespace std;
int Loopjudgment(char* b,int a[],int n1) {
	for (int i = 0;i < n1-1;i++) {
		switch (b[i]){
		case '!':
			a[i + 1] = !a[i + 1];
			break;
		case '&':
			a[i + 1] = (a[i - 1] && a[i + 1]);
			break;
		case'|':
			a[i + 1] = (a[i - 1] || a[i + 1]);
			break;
		case'>':
			if (a[i - 1])
			{
				if (a[i + 1]) a[i + 1] = 1;  else a[i + 1] = 0;
			}
			else { a[i + 1] = 1; }
			break;
		case'-':
			if ((a[i - 1] ==1&& a[i + 1]==1)||(a[i-1]==0&&a[i+1]==0)) { a[i + 1] = 1; }
			else { a[i + 1] = 0; }break;
			}
	}
	return a[n1 - 1];
}
int getvoluenum(char* b) {
	int n1 = 0;
	for (int i = 0;i < 20;i++) {
		if (b[i] == 'P') {
			n1++;
			break;
		}
	}
	for (int i = 0;i < 20;i++) {
		if (b[i] == 'Q') {
			n1++;
			break;
		}
	}
	for (int i = 0;i < 20;i++) {
		if (b[i] == 'R') {
			n1++;
			break;
		}
	}
	return n1;
}
void value(char* c, int a[],char b,int num,int n2) {
	for (int i = 0;i < n2;i++) {
		if (c[i] == b) {
			a[i] = num;
		}
	}
}
void print(char* c, int a[],int n1, int n2,int nnn[]) {
	string hequ = "";
	string xiqu = "";
	if (n1 == 2) {
		cout<< "P     " << "Q     " << c << endl;
		for (int i = 0;i < 2;i++) {
			value(c, a,'P', i,n2);
			for (int j = 0;j < 2;j++) {
				value(c,a, 'Q', j,n2);
				cout <<i<<"     " <<j<<"     " << Loopjudgment(c,a,n2)<< endl;
				if (!Loopjudgment(c, a,n2)) {
					if (i) {
						if (j) { hequ += "(!P|!Q)"; }
						else { hequ += "(!P|Q)&"; }
					}
					else {
						if (j) { hequ += "(P|!Q)&"; }
						else { hequ += "(P|Q)&"; }
					}
				}
				if (Loopjudgment(c,a, n2)) {
					if (i) {
						if (j) { xiqu += "(P&Q)"; }
						else { xiqu += "(P&!Q)|"; }
					}
					else {
						if (j) { xiqu += "(!P&Q)|"; }
						else { xiqu += "(!P&!Q)|"; }
					}
				}
			}
		}
	}
	if (n1 == 3) {
		cout << "P     " << "Q     " << "R     " << c << endl;
		for (int i = 0;i < 2;i++) {
			value(c, a,'P', i,n2);
			value(c, nnn, 'Q', i, n2);
			for (int j = 0;j < 2;j++) {
				value(c,a, 'Q', j,n2);
				value(c, nnn, 'Q', j, n2);
				for (int k = 0;k < 2;k++) {
					int nu;
					if(!k){
						value(c, a, 'R', k, n2);
						 nu = Loopjudgment(c, a, n2);
					}
					else {
						value(c, nnn, 'R', k, n2);
						if (c[0] = '!') {
							if (!i)
							{
								nnn[1] = 0;
							}
						}
						 nu = Loopjudgment(c, nnn, n2);
					}
					cout << i << "     " << j << "     " <<k<<"     " << nu << endl;
					if (!nu) {
						if (i) {
							if (j) {
								if (k) { hequ += "(!P|!Q|!R)&"; }
								else { hequ += "(!P|!Q|R)&"; }
							}
							else {
								if (k) { hequ += "(!P|Q|!R)&"; }
								else { hequ += "(!P|Q|R)&"; }
							}
						}
						else {
							if (j) {
								if (k) { hequ += "(P|!Q|!R)&"; }
								else { hequ += "(P|!Q|R)&"; }
							}
							else {
								if (k) { hequ += "(P|Q|!R)&"; }
								else { hequ += "(P|Q|R)&"; }
							}
						}

					}
					if (nu) {
						if (i) {
							if (j) {
								if (k) { xiqu += "(P&Q&R)|"; }
								else { xiqu += "(P&Q&!R)|"; }
							}
							else {
								if (k) { xiqu += "(P&!Q&R)|"; }
								else { xiqu += "(P&!Q&!R)|"; }
							}
						}
						else {
							if (j) {
								if (k) { xiqu += "(!P&Q&R)|"; }
								else { xiqu += "(!P&Q&!R)|"; }
							}
							else {
								if (k) { xiqu += "(!P&!Q&R)|"; }
								else { xiqu += "(!P&!Q&!R)|"; }
							}
						}
					}
				}
			}
		}
	}
	cout<<"主合取式是："<< endl;
	cout<< hequ << endl;
	cout<<"主析取式是："<< endl;
	cout<< xiqu << endl;
}
int main(){

	char c[20];
	int a[20];
	int n3[20] = { 0 };
	cin >> c;
	int n2 = strlen(c);
	int n1 = getvoluenum(c);
	print(c,a, n1, n2,n3);
	return 0;

}//cv李宁给你踹开线！