-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathtokenizer.cc
117 lines (99 loc) · 2.8 KB
/
tokenizer.cc
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
#include "tokenizer.hpp"
#include <cctype>
namespace pl0::tokenizer {
auto Tokenizer::tokenize() -> std::vector<Token> {
while(!isAtEnd()){
m_start = m_curr;
scanToken();
}
makeToken(TokenType::Eof);
return m_tokens;
}
auto Tokenizer::scanToken() -> void {
const char c = advance();
switch(c) {
case '\n':
m_line++;
[[fallthrough]];
case ' ':
[[fallthrough]];
case '\r':
[[fallthrough]];
case '\t':
break;
case '.':
makeToken(TokenType::Dot);
break;
case '=':
makeToken(TokenType::Equal);
break;
case ',':
makeToken(TokenType::Comma);
break;
case ';':
makeToken(TokenType::Semicolon);
break;
case ':':
makeToken(match('=')
? TokenType::Assign
: TokenType::UnexpectedCharacter);
break;
case '?':
makeToken(TokenType::QuestionMark);
break;
case '!':
makeToken(TokenType::ExclamationMark);
break;
case '#':
makeToken(TokenType::NotEqual);
break;
case '<':
makeToken(match('=')
? TokenType::LessEqual
: TokenType::Less);
break;
case '>':
makeToken(match('=')
? TokenType::GreaterEqual
: TokenType::Greater);
break;
case '+':
makeToken(TokenType::Plus);
break;
case '-':
makeToken(TokenType::Minus);
break;
case '*':
makeToken(TokenType::Star);
break;
case '/':
makeToken(TokenType::Slash);
break;
case '(':
makeToken(TokenType::LeftParen);
break;
case ')':
makeToken(TokenType::RightParen);
break;
default: {
if(std::isdigit(c)){
while(std::isdigit(peek())) advance();
makeToken(TokenType::Number);
break;
}
if(std::isalpha(c)) {
while(std::isalnum(peek())) advance();
// Check if the current identifer is a keyword
const auto lexeme = m_source.substr(m_start, m_curr - m_start);
const auto entry = m_keywords.find(lexeme);
makeToken(entry != m_keywords.end()
? entry->second
: TokenType::Identifier);
break;
}
makeToken(TokenType::UnexpectedCharacter);
break;
}
}
}
}