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
|
/*
Ousía
Copyright (C) 2014 Benjamin Paaßen, Andreas Stöckel
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef _OUSIA_UTILS_TOKENIZER_HPP_
#define _OUSIA_UTILS_TOKENIZER_HPP_
#include <istream>
#include <map>
#include <queue>
namespace ousia {
namespace utils {
class TokenizerException : public std::exception {
public:
const std::string msg;
TokenizerException(const std::string &msg) : msg(msg){};
virtual const char *what() const noexcept override { return msg.c_str(); }
};
class TokenTreeNode {
public:
const std::map<char, TokenTreeNode> children;
const int tokenId;
TokenTreeNode(const std::map<std::string, int> &inputs);
};
struct Token {
const int tokenId;
const std::string content;
const int column;
const int line;
Token(int tokenId, std::string content, int column, int line)
: tokenId(tokenId), content(content), column(column), line(line)
{
}
};
class Tokenizer {
private:
const std::istream &input;
const TokenTreeNode root;
const std::queue<Token> peekQueue;
public:
Tokenizer(const TokenTreeNode &root, std::istream &input);
bool hasNext();
const Token &next();
const Token &peek();
void reset();
};
}
}
#endif
|
