summaryrefslogtreecommitdiff
path: root/src/tools/3rdparty/cplusplus-keywordgen/cplusplus-keywordgen.cpp
blob: 45300661e653f3f3efc8ced6afce661b6dabcedd (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
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
// Copyright (c) 2007 Roberto Raggi <roberto.raggi@gmail.com>
//
// Permission is hereby granted, free of charge, to any person obtaining a copy of
// this software and associated documentation files (the "Software"), to deal in
// the Software without restriction, including without limitation the rights to
// use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
// the Software, and to permit persons to whom the Software is furnished to do so,
// subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in all
// copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
// FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
// COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
// IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
// CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

// ### TODO: Rewrite me.

#include <algorithm>
#include <cctype>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <string>
#include <vector>

class State;
class DottedItem;

typedef std::list<std::string> RuleList;
typedef RuleList::iterator RulePtr;
typedef std::list<State> StateList;
typedef StateList::iterator StatePtr;
typedef std::string::iterator Dot;
typedef std::vector<DottedItem>::iterator DottedItemPtr;

class DottedItem
{
public:
    RulePtr rule;
    Dot dot;

    DottedItem() {}

    DottedItem(RulePtr rule, Dot dot)
        : rule(rule)
        , dot(dot)
    {}

    bool operator==(const DottedItem &other) const
    {
        return rule == other.rule && dot == other.dot;
    }

    bool operator!=(const DottedItem &other) const { return !operator==(other); }

    bool terminal() const { return dot == rule->end(); }

    DottedItem next() const
    {
        DottedItem item;
        item.rule = rule;
        item.dot = dot;
        ++item.dot;
        return item;
    }
};

class State
{
public:
    State() {}

    template<typename _ForwardIterator>
    State(_ForwardIterator first, _ForwardIterator last)
    {
        _items.insert(_items.end(), first, last);
    }

    static State &intern(const State &state)
    {
        StatePtr ptr = std::find(first_state(), last_state(), state);
        if (ptr == last_state())
            ptr = states().insert(last_state(), state);
        return *ptr;
    }

    State &next(char ch)
    {
        std::vector<DottedItem> n;
        for (DottedItemPtr it = first_item(); it != last_item(); ++it) {
            if (!it->terminal() && *it->dot == ch)
                n.push_back(it->next());
        }
        return intern(State(n.begin(), n.end()));
    }

    std::set<char> firsts()
    {
        std::set<char> s;
        for (DottedItemPtr it = first_item(); it != last_item(); ++it) {
            if (!it->terminal())
                s.insert(*it->dot);
        }
        return s;
    }

    size_t item_count() const { return _items.size(); }

    DottedItemPtr first_item() { return _items.begin(); }
    DottedItemPtr last_item() { return _items.end(); }

    static StatePtr first_state() { return states().begin(); }
    static StatePtr last_state() { return states().end(); }

    bool operator==(const State &other) const { return _items == other._items; }
    bool operator!=(const State &other) const { return _items != other._items; }

    template<typename _Iterator>
    static State &start(_Iterator first, _Iterator last)
    {
        std::vector<DottedItem> items;
        for (; first != last; ++first)
            items.push_back(DottedItem(first, first->begin()));
        return intern(State(items.begin(), items.end()));
    }

    static void reset() { states().clear(); }

private:
    static StateList &states()
    {
        static StateList _states;
        return _states;
    }

private:
    std::vector<DottedItem> _items;
};

static bool option_no_enums = false;
static bool option_toupper = false;
static std::string option_namespace_name;
static std::string option_token_prefix = "Token_";
static std::string option_char_type = "char";
static std::string option_unicode_function = "";

std::string token_id(const std::string &id)
{
    std::string token = option_token_prefix;

    if (!option_toupper)
        token += id;
    else {
        for (size_t i = 0; i < id.size(); ++i)
            token += toupper(id[i]);
    }

    return token;
}

bool starts_with(const std::string &line, const std::string &text)
{
    if (text.length() < line.length()) {
        return std::equal(line.begin(), line.begin() + text.size(), text.begin());
    }
    return false;
}

void doit(State &state)
{
    static int depth{0};

    ++depth;

    std::string indent(depth * 2, ' ');

    std::set<char> firsts = state.firsts();
    for (std::set<char>::iterator it = firsts.begin(); it != firsts.end(); ++it) {
        std::string _else = it == firsts.begin() ? "" : "else ";
        std::cout << indent << _else << "if (s[" << (depth - 1) << "]" << option_unicode_function
                  << " == '" << *it << "') {" << std::endl;
        State &next_state = state.next(*it);

        bool found = false;
        for (DottedItemPtr item = next_state.first_item(); item != next_state.last_item(); ++item) {
            if (item->terminal()) {
                if (found) {
                    std::cerr << "*** Error. Too many accepting states" << std::endl;
                    exit(EXIT_FAILURE);
                }
                found = true;
                std::cout << indent << "  return " << option_namespace_name << token_id(*item->rule)
                          << ";" << std::endl;
            }
        }

        if (!found)
            doit(next_state);

        std::cout << indent << "}" << std::endl;
    }

    --depth;
}

void gen_classify_n(State &start_state, int N)
{
    std::cout << "static inline int classify" << N << "(const " << option_char_type << " *s) {"
              << std::endl;
    doit(start_state);
    std::cout << "  return " << option_namespace_name << token_id("identifier") << ";" << std::endl
              << "}" << std::endl
              << std::endl;
}

void gen_classify(const std::multimap<size_t, std::string> &keywords)
{
    std::cout << "int " << option_namespace_name << "classify(const " << option_char_type
              << " *s, int n) {" << std::endl
              << "  switch (n) {" << std::endl;
    std::multimap<size_t, std::string>::const_iterator it = keywords.begin();
    while (it != keywords.end()) {
        size_t size = it->first;
        std::cout << "    case " << size << ": return classify" << size << "(s);" << std::endl;
        do {
            ++it;
        } while (it != keywords.end() && it->first == size);
    }
    std::cout << "    default: return " << option_namespace_name << token_id("identifier") << ";"
              << std::endl
              << "  } // switch" << std::endl
              << "}" << std::endl
              << std::endl;
}

void gen_enums(const std::multimap<size_t, std::string> &keywords)
{
    std::cout << "enum {" << std::endl;
    std::multimap<size_t, std::string>::const_iterator it = keywords.begin();
    for (; it != keywords.end(); ++it) {
        std::cout << "  " << token_id(it->second) << "," << std::endl;
    }
    std::cout << "  " << token_id("identifier") << std::endl << "};" << std::endl << std::endl;
}

inline bool not_whitespace_p(char ch)
{
    return !std::isspace(ch);
}

int main(int argc, char *argv[])
{
    const std::string ns = "--namespace=";

    for (int i = 0; i < argc; ++i) {
        const std::string arg(argv[i]);
        if (arg == "--no-enums")
            option_no_enums = true;
        else if (starts_with(arg, ns)) {
            option_namespace_name.assign(arg.begin() + ns.size(), arg.end());
            option_namespace_name += "::";
        }
    }

    std::multimap<size_t, std::string> keywords;
    std::string textline;

    bool readKeywords = false;

    const std::string opt_no_enums = "%no-enums";
    const std::string opt_toupper = "%toupper";
    const std::string opt_ns = "%namespace=";
    const std::string opt_tok_prefix = "%token-prefix=";
    const std::string opt_char_type = "%char-type=";
    const std::string opt_unicode_function = "%unicode-function=";

    while (getline(std::cin, textline)) {
        // remove trailing spaces
        textline.assign(textline.begin(),
                        std::find_if(textline.rbegin(), textline.rend(), not_whitespace_p).base());

        if (!readKeywords) {
            if (textline.size() >= 2 && textline[0] == '%') {
                if (textline[1] == '%') {
                    readKeywords = true;
                } else if (textline == opt_no_enums) {
                    option_no_enums = true;
                } else if (textline == opt_toupper) {
                    option_toupper = true;
                } else if (starts_with(textline, opt_tok_prefix)) {
                    option_token_prefix.assign(textline.begin() + opt_tok_prefix.size(),
                                               textline.end());
                } else if (starts_with(textline, opt_char_type)) {
                    option_char_type.assign(textline.begin() + opt_char_type.size(), textline.end());
                } else if (starts_with(textline, opt_unicode_function)) {
                    option_unicode_function.assign(textline.begin() + opt_unicode_function.size(),
                                                   textline.end());
                } else if (starts_with(textline, opt_ns)) {
                    option_namespace_name.assign(textline.begin() + opt_ns.size(), textline.end());
                    option_namespace_name += "::";
                }

                continue;
            }
            std::cout << textline << std::endl;
        } else {
            if (textline.empty())
                continue;

            std::string::iterator start = textline.begin();
            while (start != textline.end() && std::isspace(*start))
                ++start;

            std::string::iterator stop = start;
            while (stop != textline.end() && (std::isalnum(*stop) || *stop == '_'))
                ++stop;

            if (start != stop) {
                std::string keyword(start, stop);
                if (keyword == "identifier") {
                    std::cerr << "*** Error. `identifier' is reserved" << std::endl;
                    exit(EXIT_FAILURE);
                }

                keywords.insert(std::make_pair(keyword.size(), keyword));
            }
        }
    }

    if (!option_no_enums)
        gen_enums(keywords);

    std::multimap<size_t, std::string>::iterator it = keywords.begin();
    while (it != keywords.end()) {
        size_t size = it->first;
        RuleList rules;
        do {
            rules.push_back(it->second);
            ++it;
        } while (it != keywords.end() && it->first == size);
        gen_classify_n(State::start(rules.begin(), rules.end()), size);
        State::reset();
    }

    gen_classify(keywords);
}