blob: 2584b75e830f4ace0b81fc64832d9901440b5b24 (
plain)
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
|
#include "BracketCheck.h"
#include "Stack.h"
BracketCheck::BracketCheck() { _stack = new Stack(); }
BracketCheck::~BracketCheck() { delete _stack; }
BracketCheck::BracketCheck(const std::string& s) : BracketCheck() {
for (char x : s) parse(std::string(1, x));
}
void BracketCheck::parse(const std::string& input) {
if (!_valid) return;
// match brackets
switch(input[0]) {
case '{': case '(': case '[': {
_stack->push(input);
break;
}
case '}': case ')': case ']': {
char open_bracket = _stack->pop()[0];
if (open_bracket == '{' && input[0] == '}') {
// _stack->pop(); // } is used to close blocks
break;
}
if (open_bracket == '(' && input[0] == ')') break;
if (open_bracket == '[' && input[0] == ']') break;
_valid = false;
break;
}
}
// check block ordering
switch(input[0]) {
case 'I': {
break;
}
case 'E': {
if (_stack->size() == 0) { _valid = false; break; }
if (_stack->peek()[0] != 'I') _valid = false;
break;
}
case 'D': {
break;
}
case 'W': {
if (_stack->size() > 0 && _stack->peek()[0] == 'D') { _stack->pop(); }
break;
}
}
// add blocks to stack
switch(input[0]) {
case 'I': case 'E': case 'D': case 'W': {
_stack->push(input);
}
}
}
bool BracketCheck::input_valid() {
while (_stack->size() > 0) {
char remainder = _stack->pop()[0];
switch(remainder) {
case '{': case '(': case '[': case 'D':
return false;
}
}
return _valid;
}
|