Newer
Older
**
** Made by Seblu
** Login <seblu@epita.fr>
**
** Started on Wed Aug 2 00:56:07 2006 Seblu
** Last update Fri Aug 25 15:13:58 2006 Seblu
#include <stdio.h>
#include <string.h>
#include <unistd.h>
#include "../shell/shell.h"
#include "../readline/readline.h"
/*
/* static ts_token keywords[] = */
/* { */
/* {TOK_IF, "if"}, */
/* {TOK_THEN, "then"}, */
/* {TOK_ELSE, "else"}, */
/* {TOK_FI, "fi"}, */
/* {TOK_ELIF, "elif"}, */
/* {TOK_DO, "do"}, */
/* {TOK_DONE, "done"}, */
/* {TOK_CASE, "case"}, */
/* {TOK_ESAC, "esac"}, */
/* {TOK_WHILE, "while"}, */
/* {TOK_UNTIL, "until"}, */
/* {TOK_FOR, "for"}, */
/* {TOK_IN, "in"}, */
/* {TOK_LBRACE, "{"}, */
/* {TOK_RBRACE, "}"}, */
/* {TOK_BANG, "!"}, */
/* {TOK_NONE, NULL} */
/* }; */
static ts_ast_node *regnode(ts_parser *parser, ts_ast_node *node);
** Parse an input, following the Grammar rule input
** input: list '\n'
** list EOF
** | '\n'
** | EOF
*/
static ts_ast_node *parse_input(ts_parser *parser);
static ts_ast_node *parse_list(ts_parser *parser);
static ts_ast_node *parse_andor(ts_parser *parser);
static ts_ast_node *parse_pipeline(ts_parser *parser);
static ts_ast_node *parse_command(ts_parser *parser);
/*!
** Notify a parse error
**
** @param parser parser where error appear
** @param t token near of the error
*/
static void parse_error(ts_parser *parser, ts_token t);
#if DEBUG_PARSER==1
# define debugmsg(msg) fprintf(stderr, "debug: %s\n", (msg))
#else
# define debugmsg(msg)
#endif
ts_parser *parser_init(FILE *fs)
{
ts_parser *new;
secmalloc(new, sizeof (ts_parser));
new->lexer = lexer_init(fs);
new->error = 0;
new->regnodes = NULL;
new->regsize = new->regpos = 0;
static ts_ast_node *regnode(ts_parser *parser, ts_ast_node *node)
{
if (!node)
return node;
if (parser->regpos >= parser->regsize) {
parser->regsize += 50;
secrealloc(parser->regnodes, parser->regnodes,
parser->regsize * sizeof (ts_ast_node));
}
parser->regnodes[parser->regpos] = node;
++parser->regpos;
return node;
}
static void parse_error(ts_parser *parser, ts_token t)
debugmsg("parse_error");
fprintf(stderr, "%s: syntax error near unexpected token `%s'\n",
shell->name, t.str);
parser->error = 1;
if (parser->regnodes)
for (register int i = 0; parser->regnodes[i]; ++i)
ast_destruct(parser->regnodes[i]);
longjmp(parser->stack, 1);
}
ts_ast_node *parse(ts_parser *parser)
{
parser->regpos = 0;
parser->error = 0;
// prevent of too big register ast size
if (parser->regsize >= 200)
secrealloc(parser->regnodes, parser->regnodes,
(parser->regsize = 50) * sizeof (ts_ast_node));
if (setjmp(parser->stack))
return NULL;
show_prompt(PROMPT_PS1);
#if DEBUG_LEXER == 1
ts_token tok = lexer_gettoken(parser->lexer);
exit(69);
printf("Returned token: %d [%s]\n", tok.id,
(*tok.str == '\n') ? "\\n" : tok.str);
if (tok.id == TOK_NEWLINE)
return parse_input(parser);
}
static ts_ast_node *parse_input(ts_parser *parser)
{
debugmsg("parse_input");
token = lexer_lookahead(parser->lexer);
if (token.id == TOK_EOF)
return NULL;
if (token.id == TOK_NEWLINE) {
token = lexer_gettoken(parser->lexer);
token = lexer_gettoken(parser->lexer);
if (token.id != TOK_EOF || token.id != TOK_NEWLINE)
parse_error(parser, token);
return buf;
}
static ts_ast_node *parse_list(ts_parser *parser)
ts_token token;
ts_ast_node *lhs;
ts_ast_node *rhs;
token = lexer_lookahead(parser->lexer);
if (token.id == TOK_SEP || token.id == TOK_SEPAND) {
lexer_gettoken(parser->lexer);
rhs = parse_list(parser);
if (token.id == TOK_SEP)
return regnode(parser, ast_sep_create(lhs, rhs));
else
return regnode(parser, ast_sepand_create(lhs, rhs));
}
return lhs;
static ts_ast_node *parse_andor(ts_parser *parser)
{
ts_token token;
ts_ast_node *lhs;
ts_ast_node *rhs;
debugmsg("parse_andor");
lhs = parse_pipeline(parser);
token = lexer_lookahead(parser->lexer);
if (token.id == TOK_AND || token.id == TOK_OR) {
lexer_gettoken(parser->lexer);
rhs = parse_andor(parser);
if (token.id == TOK_AND)
return regnode(parser, ast_and_create(lhs, rhs));
else
return regnode(parser, ast_or_create(lhs, rhs));
}
return lhs;
static ts_ast_node *parse_pipeline(ts_parser *parser)
{
ts_token token;
ts_ast_node *lhs;
int banged = 0;
debugmsg("parse_pipeline");
token = lexer_lookahead(parser->lexer);
if (token.id == TOK_BANG) {
lexer_gettoken(parser->lexer);
banged = 1;
}
lhs = parse_command(parser);
return lhs;
}
static ts_ast_node *parse_command(ts_parser *parser)
{
ts_token token;
token = lexer_lookahead(parser->lexer);
//if (token.id == TOK_WORD)
return NULL;
}
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
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
/* static ts_ast_node *parse_simplecommand(ts_parser *parser) */
/* { */
/* parser=parser; */
/* return NULL; */
/* } */
/* static ts_ast_node *parse_shellcommand(ts_parser *parser) */
/* { */
/* parser=parser; */
/* return NULL; */
/* } */
/* static ts_ast_node *parse_funcdec(ts_parser *parser) */
/* { */
/* parser=parser; */
/* return NULL; */
/* } */
/* static ts_ast_node *parse_cmdprefix(ts_parser *parser) */
/* { */
/* parser=parser; */
/* return NULL; */
/* } */
/* static ts_ast_node *parse_redirection(ts_parser *parser) */
/* { */
/* parser=parser; */
/* return NULL; */
/* } */
/* static ts_ast_node *parse_element(ts_parser *parser) */
/* { */
/* parser=parser; */
/* return NULL; */
/* } */
/* static ts_ast_node *parse_compound_list(ts_parser *parser) */
/* { */
/* parser=parser; */
/* return NULL; */
/* } */
/* static ts_ast_node *parse_rulefor(ts_parser *parser) */
/* { */
/* parser=parser; */
/* return NULL; */
/* } */
/* static ts_ast_node *parse_rulewhile(ts_parser *parser) */
/* { */
/* parser=parser; */
/* return NULL; */
/* } */
/* static ts_ast_node *parse_ruleuntil(ts_parser *parser) */
/* { */
/* parser=parser; */
/* return NULL; */
/* } */
/* static ts_ast_node *parse_rulecase(ts_parser *parser) */
/* { */
/* parser=parser; */
/* return NULL; */
/* } */
/* static ts_ast_node *parse_ruleif(ts_parser *parser) */
/* { */
/* parser=parser; */
/* return NULL; */
/* } */
/* static ts_ast_node *parse_elseclause(ts_parser *parser) */
/* { */
/* parser=parser; */
/* return NULL; */
/* } */
/* static ts_ast_node *parse_dogroup(ts_parser *parser) */
/* { */
/* parser=parser; */
/* return NULL; */
/* } */
/* static ts_ast_node *parse_caseclause(ts_parser *parser) */
/* { */
/* parser=parser; */
/* return NULL; */
/* } */
/* static ts_ast_node *parse_pattern(ts_parser *parser) */
/* { */
/* parser=parser; */
/* return NULL; */
/* } */