-
Notifications
You must be signed in to change notification settings - Fork 2
/
test_lex.c
169 lines (145 loc) · 4.32 KB
/
test_lex.c
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
// Generated by haxelib lex
#define LEXCHAR unsigned char
#define rlex_char(lex, i) (((LEXCHAR *)(lex)->src)[i])
#define rlex_current(lex) (((LEXCHAR *)(lex)->src) + (lex)->pos.min)
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include "rlex.h"
#include "rstream.h"
enum token {
Eof = 0,
CInt,
OpMul,
OpDiv,
OpAdd,
OpSub,
UnMathed,
};
// For template variables, please check CLexer.Config
const static unsigned char _lextable[] = {
// STATE 0
0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0x01,0x01,0xFF,0xFF,0x01,0xFF,0xFF,
0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
0x01,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0x07,0x06,0xFF,0x05,0xFF,0x04,
0x03,0x02,0x02,0x02,0x02,0x02,0x02,0x02,0x02,0x02,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
// STATE 1
0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0x01,0x01,0xFF,0xFF,0x01,0xFF,0xFF,
0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
0x01,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
// STATE 2
0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
0x02,0x02,0x02,0x02,0x02,0x02,0x02,0x02,0x02,0x02,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
// EXIT
0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0x04,0x02,0x03,0x05,0x01,0x01,0x00,0xFF
};
#define LEX_TABSIZE 400
#define LEX_TABSPAN 128
#define LEX_EXIT(s) (_lextable[(LEX_TABSIZE - 1) - (s)])
#define LEX_TRANS(s, c) (_lextable[((s) * LEX_TABSPAN) + (c)])
static int _entry(struct rlex*, int);
#define TOKEN_BEGIN 0
#define token() (_entry(lex, 0))
static int _cases(struct rlex* lex, int _q) {
int _ret = Eof;
switch(_q) {
case 0:
{
_ret = (token() );
}
break;
case 1:
{
_ret = (CInt);
}
break;
case 2:
{
_ret = (OpAdd);
}
break;
case 3:
{
_ret = (OpSub);
}
break;
case 4:
{
_ret = (OpMul);
}
break;
case 5:
{
_ret = (OpDiv);
}
break;
default:
{
printf("UnMatched : '%c' at %d-%d\n", rlex_char(lex, lex->pos.max), lex->pos.max, lex->pos.min);
exit(-1);
_ret = (0 );
}
break;
}
return _ret;
}
#undef token
static int _entry(struct rlex* lex, int begin) {
if (rlex_end(lex)) {
lex->pos.min = lex->pos.max;
return Eof;
}
int c;
int i = lex->pos.max;
int state = begin;
int prev = begin;
while(i < lex->size) {
c = rlex_char(lex, i++);
if (c > 127)
c = 127;
state = LEX_TRANS(state, c);
if (state >= 3)
break;
prev = state;
}
lex->pos.min = i; // if UnMatached then pmin >= pmax
if (state == 255) {
state = prev;
i--;
}
int q = LEX_EXIT(state);
if (i > lex->pos.max && q < 6) {
lex->pos.min = lex->pos.max;
lex->pos.max = i;
} else {
q = LEX_EXIT(begin);
}
return _cases(lex, q);
}
static int __token(struct rlex* lex) {
return _entry(lex, 0 );
}
// public function
void test_init_lexeme(struct rlex* lex, LEXCHAR *src, int size) {
lex->pos = (struct rlex_position){0, 0};
lex->size = size;
lex->src = src;
lex->token = __token;
}
// lexer end
// normal c code here