BrainLack/main.cpp at master · Flakheads/BrainLack · GitHub

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
#include <cassert>
#include <cerrno>
#include <cstring>
#include <fstream>
#include <iostream>
#include <limits>
#include <stack>
#include <vector>

#include "program_tree.h"

/*std::ostream& print_error(char* prog_name) {
	return std::cerr
*/

struct Character {
	unsigned character, line;
	char brace;

	Character(unsigned the_char, unsigned the_line, char the_brace)
		: character(the_char), line(the_line), brace(the_brace) {}
};

bool is_open_brace(char c) {
	return c == '(' || c == '[' || c == '{' || c == '<';
}

bool is_close_brace(char c) {
	return c == ')' || c == ']' || c == '}' || c == '>';
}

bool is_matching(char b1, char b2) {
	return (b1 == '(' && b2 == ')')
	    || (b1 == '[' && b2 == ']')
	    || (b1 == '{' && b2 == '}')
	    || (b1 == '<' && b2 == '>');
}

int main(int argc, char* argv[]) {
	if (argc <= 1) {
		std::cerr << argv[0] << ": no input files" << std::endl;
		return 1;
	}
	std::ifstream src_file(argv[1]);
	if (!src_file) {
		std::cerr << argv[0] << ": " << strerror(errno) << std::endl;
		return errno;
	}
	bool just_opened = false;
	unsigned char_num = 0, line_num = 1;
	char c;
	std::stack<Character> braces;
	std::stack<std::vector<std::shared_ptr<bf::Node> > > prog_tree;
	prog_tree.emplace();
	while (src_file >> c) {
		++char_num;
		if (c == '#' || c == '\n') {
			if (c == '#') {
				src_file.ignore(std::numeric_limits<std::streamsize>::max(), '\n');
			}
			char_num = 0;
			++line_num;
		} else if (is_open_brace(c)) {
			just_opened = true;
			braces.emplace(char_num, line_num, c);
			prog_tree.emplace();
		} else if (is_close_brace(c)) {
			if (braces.empty()) {
				assert(prog_tree.size() == 1);
				std::cerr << argv[0] << ": unmatched " << c << " at line " << line_num << ", char " << char_num << std::endl;
				break;
			} else if (!is_matching(braces.top().brace, c)) {
				std::cerr << argv[0] << ": mismatched " << braces.top().brace << " at line " << braces.top().line << ", char "
					<< braces.top().character << " and " << c << " at line " << line_num << ", char " << char_num << std::endl;
				break;
			}
			assert(!braces.empty());
			if (just_opened) {
				assert(prog_tree.top().empty());
				prog_tree.pop();
				prog_tree.top().push_back(bf::createNilad(c));
			} else {
				assert(!prog_tree.top().empty());
				std::shared_ptr<bf::Node> monad = bf::createMonad(c, prog_tree.top());
				prog_tree.pop();
				prog_tree.top().push_back(monad);
			}
			braces.pop();
			just_opened = false;
		}
	}
	int the_err = 0;
	if (src_file) {
		the_err = 1;
	} else if (src_file.bad()) {
		the_err = errno;
		std::cerr << argv[0] << ": " << strerror(errno) << std::endl;
	} else {
		while (!braces.empty()) {
			the_err = 1;
			std::cerr << argv[0] << ": unmatched " << braces.top().brace << " at line "
				<< braces.top().line << ", char " << braces.top().character << std::endl;
			braces.pop();
		}
	}
	src_file.close();
	if (the_err) return the_err;
	assert(prog_tree.size() == 1);
}