Updated Grammar

This commit is contained in:
Maieul BOYER 2024-07-01 12:57:51 +02:00
parent 74d642f297
commit 175efe0f2f
No known key found for this signature in database
1246 changed files with 109558 additions and 114993 deletions

View file

@ -14,43 +14,91 @@
bool lex_normal_s220(t_lexer *lexer, t_lexer_state *s)
{
if (s->lookahead == '(')
return (lex_advance(428, lexer, s));
if (s->lookahead == '{')
return (lex_advance(412, lexer, s));
if (s->eof)
return (lex_advance(235, lexer, s));
if (s->lookahead == '\n')
return (lex_skip(234, lexer, s));
return (lex_end_state(lexer, s));
}
bool lex_normal_s221(t_lexer *lexer, t_lexer_state *s)
{
if (s->lookahead == ')')
return (lex_advance(339, lexer, s));
if (s->eof)
return (lex_advance(235, lexer, s));
if (s->lookahead == '\n')
return (lex_skip(222, lexer, s));
return (lex_end_state(lexer, s));
}
bool lex_normal_s222(t_lexer *lexer, t_lexer_state *s)
{
if (s->lookahead == '+')
return (lex_advance(423, lexer, s));
if (s->lookahead == '-')
return (lex_advance(413, lexer, s));
if (s->lookahead == '=')
return (lex_advance(415, lexer, s));
if (s->lookahead == '?')
return (lex_advance(419, lexer, s));
if (s->eof)
return (lex_advance(235, lexer, s));
if (s->lookahead == '\n')
return (lex_advance(290, lexer, s));
if (s->lookahead == '#')
return (lex_advance(408, lexer, s));
if (s->lookahead == '&')
return (lex_advance(331, lexer, s));
if (s->lookahead == ')')
return (lex_advance(257, lexer, s));
if (s->lookahead == ';')
return (lex_advance(499, lexer, s));
if (s->lookahead == '<')
return (lex_advance(272, lexer, s));
if (s->lookahead == '>')
return (lex_advance(275, lexer, s));
if (s->lookahead == '\\')
return (lex_skip(230, lexer, s));
if (s->lookahead == '`')
return (lex_advance(404, lexer, s));
if (s->lookahead == 'e')
return (lex_advance(216, lexer, s));
if (s->lookahead == 'i')
return (lex_advance(214, lexer, s));
if (s->lookahead == '|')
return (lex_advance(256, lexer, s));
if (((s->lookahead >= '\t' && s->lookahead <= '\r') || \
s->lookahead == ' '))
return (lex_skip(222, lexer, s));
return (lex_end_state(lexer, s));
}
bool lex_normal_s223(t_lexer *lexer, t_lexer_state *s)
{
if (s->eof)
return (lex_advance(235, lexer, s));
if (s->lookahead == '\n')
return (lex_advance(290, lexer, s));
if (s->lookahead == '#')
return (lex_advance(408, lexer, s));
if (s->lookahead == '&')
return (lex_advance(331, lexer, s));
if (s->lookahead == ')')
return (lex_advance(257, lexer, s));
if (s->lookahead == ';')
return (lex_advance(279, lexer, s));
return (lex_advance(499, lexer, s));
if (s->lookahead == '<')
return (lex_advance(272, lexer, s));
if (s->lookahead == '>')
return (lex_advance(275, lexer, s));
if (s->lookahead == '\\')
return (lex_skip(231, lexer, s));
if (s->lookahead == '`')
return (lex_advance(403, lexer, s));
if (s->lookahead == '|')
return (lex_advance(256, lexer, s));
if (((s->lookahead >= '\t' && s->lookahead <= '\r') || \
s->lookahead == ' '))
return (lex_skip(223, lexer, s));
return (lex_end_state(lexer, s));
}
bool lex_normal_s224(t_lexer *lexer, t_lexer_state *s)
{
if (s->lookahead == '=')
return (lex_advance(361, lexer, s));
if (s->eof)
return (lex_advance(235, lexer, s));
if (s->lookahead == '\n')
return (lex_skip(223, lexer, s));
return (lex_end_state(lexer, s));
}