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
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
|
#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
#include <stdbool.h>
#include <string.h>
#include "qm.h"
#define VALID_VARIABLES "ABCDEFGHIJKLMNOPQRSTUVXYZabcdefghijklmnopqrstuvwxyz"
int main(int argc, char* argv[]) {
if (argc != 2) {
fprintf(stderr, "Incorrect number of arguments provided.\n");
}
DNF startDNF = parseDNFStr(argv[1]);
SimplifiedTableItem simplifiedTable[startDNF.numTerms];
unsigned int simplifiedTableLength = startDNF.numTerms;
setupMergeTable(simplifiedTable, &startDNF);
mergeTermsInTurn(simplifiedTable, &startDNF.numTerms);
}
void setupMergeTable(SimplifiedTableItem simplifiedTable[], DNF* dnf) {
for (int i = 0; i < dnf->numTerms; i++) {
simplifiedTable[i].term = dnf->terms[i];
simplifiedTable[i].simplifiedIndexes[0] = i;
simplifiedTable[i].numIndexes = 1;
}
}
void mergeTermsInTurn(SimplifiedTableItem simplifiedTable[], unsigned int* length) {
SimplifiedTableItem nextIteration[*length];
for (int i = 0; i < *length; i++) {
for (int j = 0; j < *length; j++) {
if (i == j) {
continue;
}
if (canMergeTerms(&simplifiedTable[i].term, &simplifiedTable[j].term)) {
// printDNFTerm(&simplifiedTable[i].term);
// printf(" + ");
// printDNFTerm(&simplifiedTable[j].term);
// printf(" = ");
DNFTerm mergedTerm = mergeTerms(&simplifiedTable[i].term, &simplifiedTable[j].term);
// printDNFTerm(&mergedTerm);
// printf("\n------\n");
}
}
}
}
bool canMergeTerms(const DNFTerm* term1, const DNFTerm* term2) {
unsigned int sameTerms = 0;
for (int i = 0; i < term1->numVars; i++) {
for (int j = 0; j < term2->numVars; j++) {
if (term1->vars[i].not_ == term2->vars[j].not_ && term1->vars[i].var == term2->vars[j].var) {
sameTerms++;
}
}
}
return term1->numVars - sameTerms == 1;
}
DNFTerm mergeTerms(const DNFTerm* term1, const DNFTerm* term2) {
DNFTerm mergedTerm;
mergedTerm.numVars = 0;
for (int i = 0; i < term1->numVars; i++) {
for (int j = 0; j < term2->numVars; j++) {
if (term1->vars[i].not_ == term2->vars[j].not_ && term1->vars[i].var == term2->vars[j].var) {
mergedTerm.vars[mergedTerm.numVars++] = (Variable){term1->vars[i].var, term1->vars[i].not_};
}
}
}
return mergedTerm;
}
bool termInTable(const SimplifiedTableItem simplifiedTable[], const unsigned int* length, const DNFTerm* term) {
for (int i = 0; i < *length; i++) {
if (termsAreEqual(&simplifiedTable[i].term, term)) {
return true;
}
}
return false;
}
bool termsAreEqual(const DNFTerm* term1, const DNFTerm* term2) {
if (term1->numVars != term2->numVars) {
return false;
}
//TODO
}
DNF parseDNFStr(const char* inpStr) {
//remove whitespace
char inpBfr[strlen(inpStr)];
int i = 0, j = 0;
while (inpStr[i] != '\0') {
if (inpStr[i] != ' ') {
inpBfr[j++] = inpStr[i];
}
i++;
}
inpBfr[j] = '\0';
DNF dnf;
dnf.numTerms = strcnt(inpBfr, '+') + 1;
char notChar;
int relIndex;
if (strcnt(inpBfr, "'"[0]) > 0) {
dnf.notChar = "'"[0];
relIndex = 1;
} else if (strcnt(inpBfr, '-') > 0) {
dnf.notChar = '-';
relIndex = -1;
}
if (strcnt(inpBfr, "'"[0]) > 0 && strcnt(inpBfr, '-') > 0) {
fprintf(stderr, "Inconsistent notation used for not.\n");
exit(EXIT_FAILURE);
}
//split up, by '+'s
const char* delim = "+";
char* subStr = strtok(inpBfr, delim);
i = 0;
while (subStr != NULL) {
dnf.terms[i++] = parseDNFTerm(subStr, dnf.notChar, relIndex);
// printf("term %i: '%s'\n", i, subStr);
subStr = strtok(NULL, delim);
}
return dnf;
}
DNFTerm parseDNFTerm(const char* termStr, const char notChar, const int relIndex) {
DNFTerm term;
term.numVars = 0;
char c;
for (int i = 0; i < INT_MAX; i++) {
c = termStr[i];
if (c == '\0') {
break;
}
if (strcnt(VALID_VARIABLES, c) == 1) {
term.vars[term.numVars++] = (Variable){c, termStr[i + relIndex] == notChar};
}
}
return term;
}
unsigned int strcnt(const char* str, const char cnt) {
// returns an integer of how many times a char was found in a char
// array
int count = 0;
for (int i = 0; i < INT_MAX; i++) {
char c = str[i];
if (c == '\0') {
break;
}
if (c == cnt) {
count++;
}
}
return count;
}
void printForm(const DNF* form) {
for (int i = 0; i < form->numTerms; i++) {
printf("(");
DNFTerm term = form->terms[i];
printDNFTerm(&term);
if (form->numTerms - 1 != i) {
printf(") ∨ ");
}
}
printf(")\n");
}
void printDNFTerm(const DNFTerm* term) {
for (int j = 0; j < term->numVars; j++) {
if (term->vars[j].not_) {
printf("¬");
}
printf("%c", term->vars[j].var);
if (term->numVars - 1 != j) {
printf("∧");
}
}
}
void printForm2(const DNF* form) {
for (int i = 0; i < form->numTerms; i++) {
DNFTerm term = form->terms[i];
for (int j = 0; j < term.numVars; j++) {
if (term.vars[j].not_ && form->notChar == '-') {
printf("-");
}
printf("%c", term.vars[j].var);
if (term.vars[j].not_ && form->notChar == "'"[0]) {
printf("'");
}
}
if (form->numTerms - 1 != i) {
printf(" + ");
}
}
printf("\n");
}
|
