summaryrefslogtreecommitdiffstats
path: root/src/libixion/formula_parser.cpp
blob: 4a8e6f5bb351a848a856619732607e3cff0e5af6 (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
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
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
 * This Source Code Form is subject to the terms of the Mozilla Public
 * License, v. 2.0. If a copy of the MPL was not distributed with this
 * file, You can obtain one at http://mozilla.org/MPL/2.0/.
 */

#include "formula_parser.hpp"
#include "ixion/formula_name_resolver.hpp"

#include "formula_functions.hpp"

#include <iostream>
#include <sstream>

namespace ixion {

namespace {

class ref_error : public general_error
{
public:
    ref_error(const std::string& msg) :
        general_error(msg) {}
};

}

// ----------------------------------------------------------------------------

formula_parser::parse_error::parse_error(const std::string& msg) :
    general_error(msg) {}

// ----------------------------------------------------------------------------

formula_parser::formula_parser(
    const lexer_tokens_t& tokens, model_context& cxt, const formula_name_resolver& resolver) :
    m_itr_cur(tokens.end()),
    m_itr_end(tokens.end()),
    m_tokens(tokens),
    m_context(cxt),
    m_resolver(resolver)
{
}

formula_parser::~formula_parser()
{
}

void formula_parser::set_origin(const abs_address_t& pos)
{
    m_pos = pos;
}

void formula_parser::parse()
{
    for (m_itr_cur = m_tokens.begin(); has_token(); next())
    {
        switch (get_token().opcode)
        {
            case lexer_opcode_t::array_open:
            case lexer_opcode_t::array_close:
            case lexer_opcode_t::open:
            case lexer_opcode_t::close:
            case lexer_opcode_t::plus:
            case lexer_opcode_t::minus:
            case lexer_opcode_t::multiply:
            case lexer_opcode_t::exponent:
            case lexer_opcode_t::concat:
            case lexer_opcode_t::equal:
            case lexer_opcode_t::divide:
            case lexer_opcode_t::sep:
            case lexer_opcode_t::array_row_sep:
                primitive();
                break;
            case lexer_opcode_t::name:
                name();
                break;
            case lexer_opcode_t::string:
                literal();
                break;
            case lexer_opcode_t::value:
                value();
                break;
            case lexer_opcode_t::less:
                less();
                break;
            case lexer_opcode_t::greater:
                greater();
                break;
            default:
                ;
        }
    }
}

formula_tokens_t& formula_parser::get_tokens()
{
    return m_formula_tokens;
}

void formula_parser::primitive()
{
    fopcode_t foc = fop_unknown;
    switch (get_token().opcode)
    {
        case lexer_opcode_t::close:
            foc = fop_close;
            break;
        case lexer_opcode_t::divide:
            foc = fop_divide;
            break;
        case lexer_opcode_t::minus:
            foc = fop_minus;
            break;
        case lexer_opcode_t::multiply:
            foc = fop_multiply;
            break;
        case lexer_opcode_t::exponent:
            foc = fop_exponent;
            break;
        case lexer_opcode_t::concat:
            foc = fop_concat;
            break;
        case lexer_opcode_t::equal:
            foc = fop_equal;
            break;
        case lexer_opcode_t::open:
            foc = fop_open;
            break;
        case lexer_opcode_t::plus:
            foc = fop_plus;
            break;
        case lexer_opcode_t::sep:
            foc = fop_sep;
            break;
        case lexer_opcode_t::array_row_sep:
            foc = fop_array_row_sep;
            break;
        case lexer_opcode_t::array_open:
            foc = fop_array_open;
            break;
        case lexer_opcode_t::array_close:
            foc = fop_array_close;
            break;
        default:
            throw parse_error("unknown primitive token received");
    }
    m_formula_tokens.emplace_back(foc);
}

void formula_parser::name()
{
    std::string_view name = std::get<std::string_view>(get_token().value);

    formula_name_t fn = m_resolver.resolve(name, m_pos);

    switch (fn.type)
    {
        case formula_name_t::cell_reference:
            m_formula_tokens.emplace_back(std::get<address_t>(fn.value));
            break;
        case formula_name_t::range_reference:
        {
            m_formula_tokens.emplace_back(std::get<range_t>(fn.value));
            break;
        }
        case formula_name_t::table_reference:
        {
            table_t table;
            formula_name_t::table_type src_table = std::get<formula_name_t::table_type>(fn.value);
            table.name = m_context.add_string(src_table.name);
            table.column_first = m_context.add_string(src_table.column_first);
            table.column_last = m_context.add_string(src_table.column_last);
            table.areas = src_table.areas;
            m_formula_tokens.emplace_back(table);
            break;
        }
        case formula_name_t::function:
            m_formula_tokens.emplace_back(std::get<formula_function_t>(fn.value));
            break;
        case formula_name_t::named_expression:
            m_formula_tokens.emplace_back(std::string{name});
            break;
        default:
        {
            std::ostringstream os;
            os << "failed to resolve a name token '" << name << "'.";
            throw parse_error(os.str());
        }
    }
}

void formula_parser::literal()
{
    string_id_t sid = m_context.add_string(std::get<std::string_view>(get_token().value));
    m_formula_tokens.emplace_back(sid);
}

void formula_parser::value()
{
    m_formula_tokens.emplace_back(std::get<double>(get_token().value));
}

void formula_parser::less()
{
    if (has_next())
    {
        next();
        switch (get_token().opcode)
        {
            case lexer_opcode_t::equal:
                m_formula_tokens.emplace_back(fop_less_equal);
                return;
            case lexer_opcode_t::greater:
                m_formula_tokens.emplace_back(fop_not_equal);
                return;
            default:
                ;
        }
        prev();
    }
    m_formula_tokens.emplace_back(fop_less);
}

void formula_parser::greater()
{
    if (has_next())
    {
        next();
        if (get_token().opcode == lexer_opcode_t::equal)
        {
            m_formula_tokens.emplace_back(fop_greater_equal);
            return;
        }
        prev();
    }
    m_formula_tokens.emplace_back(fop_greater);

}

const lexer_token& formula_parser::get_token() const
{
    return *m_itr_cur;
}

bool formula_parser::has_token() const
{
    return m_itr_cur != m_itr_end;
}

bool formula_parser::has_next() const
{
    return (m_itr_cur+1) != m_itr_end;
}

void formula_parser::next()
{
    ++m_itr_cur;
}

void formula_parser::prev()
{
    --m_itr_cur;
}

}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */