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
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
|
/*
* Copyright (c) 2025 Ian Marco Moffett and L5 engineers
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the project nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
#include <sys/types.h>
#include <sys/errno.h>
#include <sys/syslog.h>
#include <sys/param.h>
#include <np/lex.h>
#include <np/parse.h>
#include <np/ast.h>
#include <os/np.h>
#define pr_trace(fmt, ...) printf("pirho.parse: " fmt, ##__VA_ARGS__)
#define pr_error(fmt, ...) printf("pirho.parse: error: " fmt, ##__VA_ARGS__)
/* Token to string conversion table */
static const char *stoktab[] = {
/* Reserved */
[TT_NONE] = "<TT_NONE>",
/* Symbols */
[TT_LPAREN] = "<TT_LPAREN>",
[TT_RPAREN] = "<TT_RPAREN>",
[TT_IDENT] = "<IDENTIFIER>",
[TT_COMMA] = "<TT_COMMA>",
[TT_STAR] = "<TT_STAR>",
[TT_MINUS] = "<TT_MINUS>",
[TT_PLUS] = "<TT_PLUS>",
[TT_SLASH] = "<TT_SLASH>",
[TT_EQUALS] = "<TT_EQUALS>",
[TT_GT] = "<TT_GREATER>",
[TT_LT] = "<TT_LESSTHAN>",
[TT_LBRACK] = "<TT_LBRACK>",
[TT_RBRACK] = "<TT_RBRACK>",
[TT_COLON] = "<TT_COLON>",
/* Types */
[TT_U8] = "<TT_U8>",
[TT_U16] = "<TT_U16>",
[TT_U32] = "<TT_U32>",
[TT_U64] = "<TT_U64>",
[TT_I8] = "<TT_I8>",
[TT_I16] = "<TT_I16>",
[TT_I32] = "<TT_I32>",
[TT_I64] = "<TT_I64>",
/* Values */
[TT_NUMBER] = "<TT_NUMBER>",
/* Keywords */
[TT_BEGIN] = "<TT_BEGIN>",
[TT_PROC] = "<TT_PROC>",
[TT_END] = "<TT_END>"
};
/*
* Scan the next token
*
* @work: Work input
* @token: Last token
*
* Returns the token type on success (TT_NONE on error)
*/
static inline tt_t
parse_scan(struct np_work *work, struct lex_token *tok)
{
if (lex_nom(work, tok) < 0) {
return TT_NONE;
}
return tok->token;
}
/*
* Scan and expect the next token to be a specific
* value
*
* @work: Work input
* @cur: The value before the value we expect
* @what: What we expect
* @tok: Last token
*
* Returns the token type on success (TT_NONE on error)
*/
static inline tt_t
parse_expect(struct np_work *work, char *cur, tt_t what, struct lex_token *tok)
{
tt_t tt = parse_scan(work, tok);
if (tt != what) {
pr_error(
"line %d: expected %s after '%s', got %s\n",
work->line_no,
stoktab[what],
cur,
stoktab[tok->token]
);
return TT_NONE;
}
return tt;
}
/*
* Parse a type token
*
* @work: Current work
* @tok: Token result
*
* Returns the ast integer type on success, and AST_BAD_TYPE
* on failure.
*/
static ast_itype_t
parse_type(struct np_work *work, struct lex_token *tok)
{
tt_t tt;
if (work == NULL || tok == NULL) {
return AST_BAD_TYPE;
}
tt = parse_scan(work, tok);
switch (tt) {
/* Unsigned types */
case TT_U8: return AST_U8;
case TT_U16: return AST_U16;
case TT_U32: return AST_U32;
case TT_U64: return AST_U64;
/* Signed types */
case TT_I8: return AST_I8;
case TT_I16: return AST_I16;
case TT_I32: return AST_I32;
case TT_I64: return AST_I64;
}
return AST_BAD_TYPE;
}
/*
* Parse a procedure / function
*
* @work: Input work
* @tok: Current token
*
* Returns zero on success
*/
static int
parse_proc(struct np_work *work, struct lex_token *tok)
{
tt_t tt;
if (work == NULL || tok == NULL) {
return -EINVAL;
}
/* We need the identifier */
tt = parse_expect(work, "proc", TT_IDENT, tok);
if (tt == TT_NONE) {
return -1;
}
/* Expect the left paren */
tt = parse_expect(work, "<TT_IDENT>", TT_LPAREN, tok);
if (tt == TT_NONE) {
return -1;
}
/* TODO: ARGS LATER */
tt = parse_expect(work, "<TT_LPAREN>", TT_RPAREN, tok);
if (tt == TT_NONE) {
return -1;
}
/* We need the first part of '->' */
tt = parse_expect(work, "<TT_RPAREN>", TT_MINUS, tok);
if (tok == TT_NONE) {
return -1;
}
/* Now we need to complete the '->' with '>' */
tt = parse_expect(work, "<TT_MINUS>", TT_GT, tok);
if (tok == TT_NONE) {
return -1;
}
/* And now the return type */
if (parse_type(work, tok) == AST_BAD_TYPE) {
pr_error(
"line %d: expected valid type, got %s\n",
work->line_no,
stoktab[tok->token]
);
return -1;
}
return 0;
}
/*
* Parse a token
*
* @work: Input work
* @tok: Current token
*/
static int
parse_token(struct np_work *work, struct lex_token *tok)
{
tt_t tt;
int error;
/*
* XXX: wrapped in "[]" indicates optional
*
* TT_PROC => proc <TT_IDENT>(..., ...) [ -> <TYPE> ]
*/
switch (tok->token) {
case TT_PROC:
if ((error = parse_proc(work, tok)) != 0) {
return -1;
}
break;
}
return 0;
}
int
parse_work(struct np_work *work)
{
struct lex_token tok;
int error = 0;
if (work == NULL) {
pr_error("bad work argument\n");
return -EINVAL;
}
/* Get the AST root node */
work->ast_root = ast_alloc(work);
if (work->ast_root == NULL) {
pr_error("failed to alloc root AST|n");
return -ENOMEM;
}
while (error == 0) {
error = lex_nom(work, &tok);
if (error < 0) {
return error;
}
/* Don't overflow the table */
if (tok.token > NELEM(stoktab)) {
pr_error("bad token %d\n", tok.token);
return -1;
}
if (parse_token(work, &tok) < 0) {
return -1;
}
}
return 0;
}
|