pluto-src 0.1.1+0.10.4

Sources of Pluto (Lua 5.4 dialect) and logic to build it.
Documentation 
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

#include "ParserState.hpp"

#include <string>

#include "LangDesc.hpp"
#include "Lexeme.hpp"
#include "ParseError.hpp"
#include "parse_tree.hpp"
#include "UniquePtr.hpp"

#define ENSURE_SANITY false

NAMESPACE_SOUP
{
	void ParserState::setOp(int type)
	{
		op.type = type;
	}

	void ParserState::consumeLefthandValue()
	{
		auto node = popLefthand();
		if (!node->isValue())
		{
			std::string err = static_cast<LexemeNode*>(i->get())->lexeme.token_keyword;
			err.append(" expected lefthand value, found ");
			err.append(node->toString());
			SOUP_THROW(ParseError(std::move(err)));
		}
		pushArgNode(std::move(node));
#if ENSURE_SANITY
		ensureValidIterator();
#endif
	}

	void ParserState::consumeRighthandValue()
	{
		auto node = popRighthand();
		if (!node->isValue())
		{
			throwExpectedRighthandValue(node);
		}
		pushArgNode(std::move(node));
#if ENSURE_SANITY
		ensureValidIterator();
#endif
	}

	void ParserState::throwExpectedRighthandValue(const UniquePtr<astNode>& node)
	{
		std::string err = static_cast<LexemeNode*>(i->get())->lexeme.token_keyword;
		err.append(" expected righthand value, found ");
		err.append(node->toString());
		SOUP_THROW(ParseError(std::move(err)));
	}

	void ParserState::pushArg(Mixed&& val)
	{
		pushArgNode(soup::make_unique<LexemeNode>(Lexeme{ Lexeme::VAL, std::move(val) }));
	}

	void ParserState::pushArgNode(UniquePtr<astNode>&& node)
	{
		op.args.emplace_back(std::move(node));
	}

	void ParserState::setArgs(std::vector<UniquePtr<astNode>>&& args)
	{
		op.args = std::move(args);
	}

	void ParserState::pushLefthand(Mixed&& val)
	{
		pushLefthand(Lexeme{ Lexeme::VAL, std::move(val) });
	}

	void ParserState::pushLefthand(Lexeme&& l)
	{
		pushLefthandNode(soup::make_unique<LexemeNode>(std::move(l)));
	}

	void ParserState::pushLefthandNode(UniquePtr<astNode>&& node)
	{
		i = b->children.insert(i, std::move(node));
		++i;
	}

	astNode* ParserState::peekLefthand() const noexcept
	{
		if (i != b->children.begin())
		{
			return (i - 1)->get();
		}
		return nullptr;
	}

	UniquePtr<astNode> ParserState::popLefthand()
	{
		if (i == b->children.begin())
		{
			std::string err = static_cast<LexemeNode*>(i->get())->lexeme.token_keyword;
			err.append(" expected lefthand, found start of block");
			SOUP_THROW(ParseError(std::move(err)));
		}
		--i;
		UniquePtr<astNode> ret = std::move(*i);
		i = b->children.erase(i);
#if ENSURE_SANITY
		ensureValidIterator();
#endif
		return ret;
	}

	astNode* ParserState::peekRighthand() const
	{
		checkRighthand();
		return (i + 1)->get();
	}

	UniquePtr<astNode> ParserState::popRighthand()
	{
		checkRighthand();
		++i;
		UniquePtr<astNode> ret = std::move(*i);
		i = b->children.erase(i);
		--i;
#if ENSURE_SANITY
		ensureValidIterator();
#endif
		return ret;
	}

	UniquePtr<astBlock> ParserState::collapseRighthandBlock(const char* end_token)
	{
		auto b = soup::make_unique<astBlock>();
		for (UniquePtr<astNode> node;
			node = popRighthand(), node->type != astNode::LEXEME || static_cast<LexemeNode*>(node.get())->lexeme.token_keyword != end_token;
			)
		{
			b->children.emplace_back(std::move(node));
		}
		return b;
	}

	const Token& ParserState::getToken() const
	{
		return *ld->findToken(static_cast<LexemeNode*>(i->get())->lexeme);
	}

	void ParserState::checkRighthand() const
	{
		if ((i + 1) == b->children.end())
		{
			std::string err = static_cast<LexemeNode*>(i->get())->lexeme.token_keyword;
			err.append(" expected righthand, found end of block");
			SOUP_THROW(ParseError(std::move(err)));
		}
	}

	void ParserState::ensureValidIterator() const
	{
		SOUP_ASSERT((*i)->type == astNode::LEXEME
			&& static_cast<LexemeNode*>(i->get())->lexeme.token_keyword != Lexeme::VAL
		);
	}
}