生成真值表的代码

输入一个真值表达式, 程序自动生成它的真值表.

纯模拟思路

合取* 析取| 单条件> 双条件- 非!

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
int cnt = 0, chval[26] = {};

void getAlpha(string str, char *chs, int &cnt)  //获取真值表中的字符 
{
	int ch[26] = {};
	for(int i = 0; i < (int)str.length(); ++i) {
		if(isalpha(str[i])) ch[str[i] - 'a'] ++;
	}
	for(int i = 0; i < 26; ++i) {
		if(ch[i]) {
			chs[cnt++] = i+97;
		}
	}
}

string shuzhitihuan(string str, int chval[26])
{
	string st = "";
	for(int i = 0; i < str.size(); ++i) {
		if(str[i] <= 'z' && str[i] >= 'a') {
			st += chval[str[i] - 'a'] ? "1":"0";
		} else st += str[i];
	}
	return st;
}

void qvkuohao(string & str)  //需要去除两种括号()(1)(0)
{
	string st = "";
	for(int i = 0; i < str.size(); ++i) {
		if(str[i] == '(' && i+2 < str.size() && str[i+2] == ')') {
			st += str[i+1];
			i += 2;
		} else st += str[i];
	}
	str = st;
}

void qvfei(string &str) 
{
	string st = "";
	for(int i = 0; i < str.size(); ++i) {
		if(str[i] == '!' && i+1 < str.size() && str[i+1] == '0') {
			st += '1';
			i++;
		} else if(str[i] == '!' && i + 1 < str.size() && str[i+1] == '1') {
			st += '0';
			i++;
		} else st += str[i];
	}
	str = st;
} 

void qvheqv(string &str)
{
	string st = "";
	for(int i = 0; i < str.size(); ++i) {
		if(str[i] == '1' && i+2 < str.size() && str[i+2] == '1' && str[i+1] == '*') {
			st += '1';
			i += 2;
		} else if(i+2 < str.size() && str[i+1] == '*' && ((str[i] == '1' && str[i+2] == '0')
		|| (str[i] == '0' && str[i+2] == '1') || (str[i] == '0' && str[i+2] == '0'))) {
			st += '0';
			i += 2;
		} else st += str[i];
	}
	str = st;
}

void qvxiqv(string & str)
{
	string st = "";
	for(int i = 0; i < str.size(); ++i) {
		if(str[i] == '0' && i+2 < str.size() && str[i+2] == '0' && str[i+1] == '|') {
			st += '0';
			i += 2;
		} else if (i+2 < str.size() && str[i+1] == '|' && ((str[i] == '1' && str[i+2] == '0')
		|| (str[i] == '0' && str[i+2] == '1') || (str[i] == '1' && str[i+2] == '1'))) {
			st += '1';
			i += 2;
		} else st += str[i];
	}
	str = st;
}

void qvdantiaojian(string &str)
{
	string st = "";
	for(int i = 0; i < str.size(); ++i) {
		if(str[i + 1] == '>' && str[i] == '1' && str[i+2] == '0') {
			st += '0';
			i += 2;
		} else if(str[i+1] == '>' && ((str[i] == '1' && str[i+2] == '1')
		|| str[i] == '0' &&(str[i+2] == '1' || str[i+2] == '0'))) {
			st += '1';
			i += 2;
		} else st += str[i];
	}
	str = st;
}

void qvshuangtiaojian(string &str)
{
	string st = "";
	for(int i = 0; i < str.size(); ++i) {
		if(str[i+1] == '-' && ((str[i] == '1' && str[i+2] == '1') || (str[i] == '0' && str[i+2] == '0'))) {
			st += '1';
			i += 2;
		} else if(str[i+1] == '-' && ((str[i] == '1' && str[i+2] == '0') || (str[i] == '0' && str[i+2] == '1'))) {
			st += '0';
			i += 2;
		} else st += str[i]; 
	}
	str = st;
}

int main()
{
	string str, tmp;
	char chs[12];
	cin >> str;
	getAlpha(str, chs, cnt);  //只讨论小写字母
	tmp = str;
	for(int j = 0; j < cnt; ++j) {
		cout << chs[j] << "  ";
	} 
	cout << tmp;
	cout << endl;
	for(int i = 0; i < pow(2, cnt); ++i) {
		for(int j = 0; j < cnt; ++j) { //赋值过程 
			chval[chs[j] - 'a'] = (1 & (i>>(cnt-1-j)));
		}	cout << endl;
		for(int j = 0; j < cnt; ++j) {
			cout << chval[chs[j] - 'a'] << "  ";
		}
		str = shuzhitihuan(str, chval);
		while(str.size() != 1) {
			qvkuohao(str);
			qvfei(str);
			qvheqv(str);
			qvxiqv(str);
			qvdantiaojian(str);
			qvshuangtiaojian(str); 
		}
		for(int i = 0; i < tmp.size() / 2; ++i) cout << ' ';
		cout <<  str << endl;
		str = tmp;
	}
}

/*
((p*q)*r) 
(p*q)|(!p*!q)
(!p|q)*(!q|p) 
(p>q)*(q>p)
!(p*q)>(!p*!q)
p-q 
(!p|r)*(r>q)|p*q
p*q|r*b
*/