Make a Lisp
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

164 lines
3.7 KiB

2 years ago
/*
* Copyright (C) 2023 Riyyi
*
* SPDX-License-Identifier: MIT
*/
#include <iterator> // std::next
#include <memory> // std::static_pointer_cast
#include <string>
#include "ruc/format/format.h"
2 years ago
#include "ast.h"
#include "error.h"
#include "lexer.h"
2 years ago
#include "printer.h"
#include "types.h"
#include "util.h"
2 years ago
namespace blaze {
Printer::Printer()
2 years ago
{
}
Printer::~Printer()
{
}
// -----------------------------------------
std::string Printer::print(ASTNodePtr node, bool print_readably)
2 years ago
{
if (Error::the().hasAnyError()) {
init();
printError();
return m_print;
}
return printNoErrorCheck(node, print_readably);
}
std::string Printer::printNoErrorCheck(ASTNodePtr node, bool print_readably)
{
init();
if (node == nullptr) {
return {};
2 years ago
}
printImpl(node, print_readably);
return m_print;
}
// -----------------------------------------
void Printer::init()
{
m_first_node = true;
m_previous_node_is_list = false;
m_print = "";
2 years ago
}
void Printer::printImpl(ASTNodePtr node, bool print_readably)
2 years ago
{
auto printSpacing = [this]() -> void {
if (!m_first_node && !m_previous_node_is_list) {
m_print += ' ';
2 years ago
}
};
ASTNode* node_raw_ptr = node.get();
if (is<List>(node_raw_ptr)) {
printSpacing();
m_print += '(';
m_first_node = false;
m_previous_node_is_list = true;
auto nodes = std::static_pointer_cast<List>(node)->nodes();
for (size_t i = 0; i < nodes.size(); ++i) {
printImpl(nodes[i]);
m_previous_node_is_list = false;
}
m_print += ')';
}
else if (is<Vector>(node_raw_ptr)) {
printSpacing();
m_print += '[';
m_first_node = false;
m_previous_node_is_list = true;
auto nodes = std::static_pointer_cast<Vector>(node)->nodes();
for (size_t i = 0; i < nodes.size(); ++i) {
printImpl(nodes[i]);
m_previous_node_is_list = false;
}
m_print += ']';
}
else if (is<HashMap>(node_raw_ptr)) {
printSpacing();
m_print += "{";
m_first_node = false;
m_previous_node_is_list = true;
auto elements = std::static_pointer_cast<HashMap>(node)->elements();
for (auto it = elements.begin(); it != elements.end(); ++it) {
m_print += format("{} ", it->first.front() == 0x7f ? ":" + it->first.substr(1) : it->first); // 127
printImpl(it->second);
if (isLast(it, elements)) {
m_print += ' ';
}
}
m_previous_node_is_list = false;
m_print += '}';
}
else if (is<String>(node_raw_ptr)) {
std::string text = std::static_pointer_cast<String>(node)->data();
if (print_readably) {
text = replaceAll(text, "\\", "\\\\");
text = replaceAll(text, "\"", "\\\"");
text = replaceAll(text, "\n", "\\n");
text = "\"" + text + "\"";
}
2 years ago
printSpacing();
m_print += format("{}", text);
2 years ago
}
else if (is<Keyword>(node_raw_ptr)) {
printSpacing();
m_print += format(":{}", std::static_pointer_cast<Keyword>(node)->keyword().substr(1));
}
else if (is<Number>(node_raw_ptr)) {
2 years ago
printSpacing();
m_print += format("{}", std::static_pointer_cast<Number>(node)->number());
2 years ago
}
else if (is<Value>(node_raw_ptr)) {
printSpacing();
std::string value;
switch (std::static_pointer_cast<Value>(node)->state()) {
case Value::Nil: value = "nil"; break;
case Value::True: value = "true"; break;
case Value::False: value = "false"; break;
}
m_print += format("{}", value);
}
else if (is<Symbol>(node_raw_ptr)) {
2 years ago
printSpacing();
m_print += format("{}", std::static_pointer_cast<Symbol>(node)->symbol());
2 years ago
}
}
void Printer::printError()
{
m_print = "Error: ";
if (Error::the().hasTokenError()) {
Token error = Error::the().tokenError();
m_print += format("{}", error.symbol);
}
else if (Error::the().hasOtherError()) {
std::string error = Error::the().otherError();
m_print += format("{}", error);
}
}
2 years ago
} // namespace blaze