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
/*
   Copyright (C) 2009-2019 Andreas Franz Borchert
                           Michael Christian Lehn
   ----------------------------------------------------------------------------
   Astl-ULMcalc is free software; you can redistribute it
   and/or modify it under the terms of the GNU Library General Public
   License as published by the Free Software Foundation; either version
   2 of the License, or (at your option) any later version.

   Astl-ULMcalc is distributed in the hope that it will be
   useful, but WITHOUT ANY WARRANTY; without even the implied warranty
   of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
   Library General Public License for more details.

   You should have received a copy of the GNU Library General Public
   License along with this library; if not, write to the Free Software
   Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/

#include "scanner.hpp"
#include "parser.hpp"
#include "keywords.hpp"

namespace AstlULMcalc {

struct Keyword {
   char const* keyword;
   int token;
};

Keyword keyword_tab[] = {
   /* pseudo-ops */
//   {".align", parser::token::DOT_ALIGN},
};

Keyword operator_tab[] = {
//   {"w0", parser::token::W0},
};

KeywordTable::KeywordTable() {
   for (auto& keyword: keyword_tab) {
      keywords.insert({keyword.keyword, keyword.token});
   }
   for (auto& op: operator_tab) {
      operators.insert({op.keyword, op.token});
   }
}

bool KeywordTable::lookup_keyword(const std::string& ident, int& token) const {
   auto it = keywords.find(ident);
   if (it == keywords.end()) {
      return false;
   } else {
      token = it->second;
      return true;
   }
}

bool KeywordTable::lookup_operator(const std::string& ident, int& token) const {
   auto it = operators.find(ident);
   if (it == operators.end()) {
      return false;
   } else {
      token = it->second;
      return true;
   }
}

KeywordTable keyword_table;

} // namespace AstlULMcalc