Completely refactor code generation

1 files changed, 88 insertions, 0 deletions

diff --git a/src/output_common.cpp b/src/output_common.cpp
new file mode 100644
index 0000000..a0ed757
--- /dev/null
+++ b/src/output_common.cpp
@@ -0,0 +1,88 @@
+/*
+  Copyright (c) 2015, Matthias Schiffer <mschiffer@universe-factory.net>
+  All rights reserved.
+
+  Redistribution and use in source and binary forms, with or without
+  modification, are permitted provided that the following conditions are met:
+
+    1. Redistributions of source code must retain the above copyright notice,
+       this list of conditions and the following disclaimer.
+    2. Redistributions in binary form must reproduce the above copyright notice,
+       this list of conditions and the following disclaimer in the documentation
+       and/or other materials provided with the distribution.
+
+  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+  DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+  FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+  DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+  SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+  CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+  OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+  OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+
+
+#include "output_common.hpp"
+
+
+namespace solar {
+
+output_common_t::output_common_t(const generator_t *generator0, const std::string &prefix0, const std::string &token_prefix0) :
+	generator(generator0), prefix(prefix0), token_prefix(token_prefix0) {
+	for (const std::string &nonterm : generator->get_nonterminals())
+		symbol_values.insert(std::make_pair(symbol_t::make_nonterm(nonterm.c_str()), "symbol_" + nonterm));
+
+	for (const symbol_t &term : generator->get_terminals()) {
+		if (term.get_type() == SYMBOL_TYPE_TERM)
+			tokens.insert(std::make_pair(token_prefix + term.get_value(), tokens.size()));
+
+		symbol_values.insert(std::make_pair(term, "token." + generator->get_grammar().get_term_type(term).second));
+	}
+
+}
+
+std::string output_common_t::symbol_case(const symbol_t &sym) const {
+	if (sym.get_type() == SYMBOL_TYPE_CHAR) {
+		switch (sym.get_value()[0]) {
+		case '\a':
+			return "'\\a'";
+
+		case '\b':
+			return "'\\b'";
+
+		case '\f':
+			return "'\\f'";
+
+		case '\n':
+			return "'\\n'";
+
+		case '\r':
+			return "'\\r'";
+
+		case '\t':
+			return "'\\t'";
+
+		case '\v':
+			return "'\\v'";
+
+		case '\\':
+			return "'\\\\'";
+
+		case '\'':
+			return "'\\''";
+
+		default:
+			return "'" +  sym.get_value() + "'";
+		}
+	}
+	else {
+		if (sym.get_value().empty())
+			return "0";
+		else
+			return token_prefix + sym.get_value();
+	}
+}
+
+}