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,13 +19,16 @@ bool lex_normal_s110(t_lexer *lexer, t_lexer_state *s)
if ((s->lookahead == '\t' || s->lookahead == ' '))
return (lex_skip(110, lexer, s));
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
return (lex_advance(486, lexer, s));
if ((s->lookahead >= '0' && s->lookahead <= '9'))
return (lex_advance(407, lexer, s));
return (lex_advance(463, 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 < ')') && s->lookahead != ';' && s->lookahead \
s->lookahead < '*') && s->lookahead != ';' && s->lookahead \
!= '<'))
return (lex_advance(528, lexer, s));
return (lex_advance(497, lexer, s));
return (lex_end_state(lexer, s));
}
@ -33,15 +36,13 @@ bool lex_normal_s111(t_lexer *lexer, t_lexer_state *s)
{
if (lex_normal_map111(lexer, s))
return (true);
if ((s->lookahead == '\t' || s->lookahead == ' '))
if (((s->lookahead >= '\t' && s->lookahead <= '\r') || \
s->lookahead == ' '))
return (lex_skip(111, lexer, s));
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
return (lex_advance(487, lexer, s));
if ((s->lookahead >= '0' && s->lookahead <= '9'))
return (lex_advance(407, lexer, s));
if ((s->lookahead != 0 && (s->lookahead > '&' && \
s->lookahead < ')')))
return (lex_advance(528, lexer, s));
if (((s->lookahead >= '1' && s->lookahead <= '9') || \
(s->lookahead >= 'A' && s->lookahead <= 'Z') || \
(s->lookahead >= 'a' && s->lookahead <= 'z')))
return (lex_advance(418, lexer, s));
return (lex_end_state(lexer, s));
}
@ -49,13 +50,19 @@ bool lex_normal_s112(t_lexer *lexer, t_lexer_state *s)
{
if (lex_normal_map112(lexer, s))
return (true);
if (((s->lookahead >= '\t' && s->lookahead <= '\r') || \
s->lookahead == ' '))
if ((s->lookahead == '\t' || s->lookahead == ' '))
return (lex_skip(112, 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(464, 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 < '*') && s->lookahead != ';' && s->lookahead \
!= '<'))
return (lex_advance(497, lexer, s));
return (lex_end_state(lexer, s));
}
@ -63,18 +70,13 @@ bool lex_normal_s113(t_lexer *lexer, t_lexer_state *s)
{
if (lex_normal_map113(lexer, s))
return (true);
if ((s->lookahead == '\t' || s->lookahead == ' '))
if (((s->lookahead >= '\t' && s->lookahead <= '\r') || \
s->lookahead == ' '))
return (lex_skip(113, lexer, s));
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
return (lex_advance(488, 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));
}
@ -85,10 +87,15 @@ bool lex_normal_s114(t_lexer *lexer, t_lexer_state *s)
if ((s->lookahead == '\t' || s->lookahead == ' '))
return (lex_skip(114, lexer, s));
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
return (lex_advance(489, 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(465, 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 < '*') && s->lookahead != ';' && s->lookahead \
!= '<'))
return (lex_advance(497, lexer, s));
return (lex_end_state(lexer, s));
}