-
Notifications
You must be signed in to change notification settings - Fork 0
/
lex.h
161 lines (147 loc) · 3.27 KB
/
lex.h
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
/********************************************************************/
/*Projekt:Implementace interpretu imperativního jazyka IFJ16 */
/*Jména řešitelů: Sebastián Kisela, Ondrej Svoreň, Daniel Rudík, */
/* Patrik Roman, Martin Chudý */
/*Loginy řešitelů: xkisel02, xsvore01, xrudik00, xroman10, xchudy04 */
/********************************************************************/
#ifndef LexDefs
#define LexDefs
#include "defs.h"
#include "error.h"
#include "stack.h"
extern char *keywords[];
#define STR_LEN_INC 8
#define STR_ERROR 1
#define STR_SUCCESS 0
typedef struct{
char *data;
int used;
int capacity;
}TBuffer;
//struktura pro token
typedef struct{
int lineNumber;
char* data;
int type;
}Ttoken;
Ttoken *getTokenFromStack();
Ttoken *get_token();
int extendBuffer(TBuffer*, char);
int isKeyword(TBuffer*);
void lexFinish();
void lexStart();
void unget_token(int);
Ttoken * newToken();
//char *printToken();
//stavy automatu
typedef enum
{
KEYWORD_BOOLEAN, //0
KEYWORD_BREAK, //1
KEYWORD_CLASS, //2
KEYWORD_CONTINUE, //3
KEYWORD_DO, //4
KEYWORD_DOUBLE, //5
KEYWORD_ELSE, //6
KEYWORD_FALSE, //7
KEYWORD_FOR, //8
KEYWORD_IF, //9
KEYWORD_INT,//10
KEYWORD_RETURN, //11
KEYWORD_STRING, //12
KEYWORD_STATIC, //13
KEYWORD_TRUE, //14
KEYWORD_VOID, //15
KEYWORD_WHILE, //16
STATE_INIT, //17
STATE_END, //18 koncový stav
STATE_PLUS, //19
STATE_MINUS, //20
STATE_MUL, //21
STATE_DIV, //22
STATE_INC,//23
STATE_DEC,//24
STATE_ASSIGN, //25
STATE_EQUALS, //26
STATE_GREATER, //27
STATE_LESS, //28
STATE_GR_EQ, //29
STATE_LE_EQ, //30
STATE_EXCL_MARK, //31
STATE_NOT_EQ, //32
STATE_DOT, //33
STATE_SEM_CL, //34
STATE_COLON, //35
STATE_QUOTE, //36
STATE_OR, //37
STATE_LOGIC_OR, //38
STATE_AND, //39
STATE_LOGIC_AND, //40
STATE_L_ROUND, //41
STATE_R_ROUND, //42
STATE_L_SQUARE, //43
STATE_R_SQUARE, //44
STATE_L_CURLY, //45
STATE_R_CURLY, //46
STATE_DOUBLE_E, //47
STATE_LINE_COM, //48
STATE_BEGIN_COM, //49
STATE_END_COM, //50
STATE_ID, //51
STATE_STRING_DOUBLE, //52
STATE_INT, //53
STATE_FUT_DOUBLE, //54
STATE_DOUBLE, //55
STATE_COMMA, //56
TOKEN_PLUS, //57 +
TOKEN_MINUS, //58 -
TOKEN_MUL, //59 *
TOKEN_DIV, //60 /
TOKEN_INC,//61
TOKEN_DEC,//62
TOKEN_MOD, //63 %
TOKEN_ASSIGN, //64 =
TOKEN_EQUALS, //65 ==
TOKEN_GREATER, //66 >
TOKEN_LESS, //67 <
TOKEN_GR_EQ, //68 >=
TOKEN_LE_EQ, //69 <=
TOKEN_EXCL_MARK, //70 !
TOKEN_NOT_EQ, //71 !=
TOKEN_DOT, //72 .
TOKEN_SEM_CL, //73 ;
TOKEN_COLON, //74 :
TOKEN_QUOTE, //75 "
TOKEN_OR, //76 |
TOKEN_LOGIC_OR, //77 ||
TOKEN_AND, //78 &
TOKEN_LOGIC_AND, //79 &&
TOKEN_L_ROUND, //80 (
TOKEN_R_ROUND, //81 )
TOKEN_L_SQUARE, //82 [
TOKEN_R_SQUARE, //83 ]
TOKEN_L_CURLY, //84 {
TOKEN_R_CURLY, //85 }
TOKEN_E, //86 [0-9e0-9]
TOKEN_DOUBLE_E, //87 [0-9.0-9e0-9]
TOKEN_LINE_COM, //88 //
TOKEN_BEGIN_COM, //89 /*
TOKEN_END_COM, //90 */
TOKEN_ID, //91 [a-Z0-9]
TOKEN_STRING, //92 string
TOKEN_INT, //93 integer
TOKEN_DOUBLE, //94 double
TOKEN_COMMA, //95 ,
TOKEN_EOF, //96
STATE_STRING_SINGLE, //97
STATE_E, //98
TOKEN_DEC_E, //99
STATE_ASCII_DOUBLE, //100
STATE_ASCII_SINGLE,
TOKEN_TYPE,
TOKEN_FUNCTION,
STATE_OCTAL,
STATE_FUT_E,
STATE_FUT_DOUBLE_E,
}tState;
#endif