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

@ -19,11 +19,12 @@ bool lex_normal_s105(t_lexer *lexer, t_lexer_state *s)
if ((s->lookahead == '\t' || s->lookahead == ' '))
return (lex_skip(105, lexer, s));
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
return (lex_advance(482, lexer, s));
return (lex_advance(460, lexer, s));
if ((s->lookahead >= '0' && s->lookahead <= '9'))
return (lex_advance(407, lexer, s));
if (s->lookahead != 0)
return (lex_advance(528, lexer, s));
return (lex_advance(380, lexer, s));
if ((s->lookahead != 0 && (s->lookahead > '&' && \
s->lookahead < ')')))
return (lex_advance(497, lexer, s));
return (lex_end_state(lexer, s));
}
@ -34,12 +35,15 @@ bool lex_normal_s106(t_lexer *lexer, t_lexer_state *s)
if ((s->lookahead == '\t' || s->lookahead == ' '))
return (lex_skip(106, lexer, s));
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
return (lex_advance(483, lexer, s));
if ((s->lookahead >= '0' && s->lookahead <= '9'))
return (lex_advance(407, lexer, s));
return (lex_advance(461, lexer, s));
if ((s->lookahead >= '1' && s->lookahead <= '9'))
return (lex_advance(381, lexer, s));
if (((s->lookahead >= 'A' && s->lookahead <= 'Z') || \
(s->lookahead >= 'a' && s->lookahead <= 'z')))
return (lex_advance(413, lexer, s));
if ((s->lookahead != 0 && (s->lookahead > '&' && \
s->lookahead < ')')))
return (lex_advance(528, lexer, s));
s->lookahead < '*')))
return (lex_advance(497, lexer, s));
return (lex_end_state(lexer, s));
}
@ -47,18 +51,13 @@ bool lex_normal_s107(t_lexer *lexer, t_lexer_state *s)
{
if (lex_normal_map107(lexer, s))
return (true);
if ((s->lookahead == '\t' || s->lookahead == ' '))
if (((s->lookahead >= '\t' && s->lookahead <= '\r') || \
s->lookahead == ' '))
return (lex_skip(107, lexer, s));
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
return (lex_advance(484, lexer, s));
if ((s->lookahead >= '1' && s->lookahead <= '9'))
return (lex_advance(408, lexer, s));
if (((s->lookahead >= 'A' && s->lookahead <= 'Z') || \
if (((s->lookahead >= '1' && s->lookahead <= '9') || \
(s->lookahead >= 'A' && s->lookahead <= 'Z') || \
(s->lookahead >= 'a' && s->lookahead <= 'z')))
return (lex_advance(440, lexer, s));
if ((s->lookahead != 0 && (s->lookahead > '&' && \
s->lookahead < '*')))
return (lex_advance(528, lexer, s));
return (lex_advance(418, lexer, s));
return (lex_end_state(lexer, s));
}
@ -66,13 +65,18 @@ bool lex_normal_s108(t_lexer *lexer, t_lexer_state *s)
{
if (lex_normal_map108(lexer, s))
return (true);
if (((s->lookahead >= '\t' && s->lookahead <= '\r') || \
s->lookahead == ' '))
if ((s->lookahead == '\t' || s->lookahead == ' '))
return (lex_skip(108, lexer, s));
if (((s->lookahead >= '1' && s->lookahead <= '9') || \
(s->lookahead >= 'A' && s->lookahead <= 'Z') || \
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
return (lex_advance(462, lexer, s));
if ((s->lookahead >= '1' && s->lookahead <= '9'))
return (lex_advance(381, lexer, s));
if (((s->lookahead >= 'A' && s->lookahead <= 'Z') || \
(s->lookahead >= 'a' && s->lookahead <= 'z')))
return (lex_advance(445, lexer, s));
return (lex_advance(413, lexer, s));
if ((s->lookahead != 0 && (s->lookahead > '&' && \
s->lookahead < '*')))
return (lex_advance(497, lexer, s));
return (lex_end_state(lexer, s));
}
@ -80,16 +84,12 @@ bool lex_normal_s109(t_lexer *lexer, t_lexer_state *s)
{
if (lex_normal_map109(lexer, s))
return (true);
if ((s->lookahead == '\t' || s->lookahead == ' '))
if (((s->lookahead >= '\t' && s->lookahead <= '\r') || \
s->lookahead == ' '))
return (lex_skip(109, lexer, s));
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
return (lex_advance(485, lexer, s));
if ((s->lookahead >= '1' && s->lookahead <= '9'))
return (lex_advance(408, lexer, s));
if (((s->lookahead >= 'A' && s->lookahead <= 'Z') || \
if (((s->lookahead >= '1' && s->lookahead <= '9') || \
(s->lookahead >= 'A' && s->lookahead <= 'Z') || \
(s->lookahead >= 'a' && s->lookahead <= 'z')))
return (lex_advance(440, lexer, s));
if (s->lookahead != 0)
return (lex_advance(528, lexer, s));
return (lex_advance(418, lexer, s));
return (lex_end_state(lexer, s));
}