Updated Grammar
This commit is contained in:
parent
74d642f297
commit
175efe0f2f
1246 changed files with 109558 additions and 114993 deletions
|
|
@ -16,16 +16,13 @@ bool lex_normal_s115(t_lexer *lexer, t_lexer_state *s)
|
|||
{
|
||||
if (lex_normal_map115(lexer, s))
|
||||
return (true);
|
||||
if ((s->lookahead == '\t' || s->lookahead == ' '))
|
||||
if (((s->lookahead >= '\t' && s->lookahead <= '\r') || \
|
||||
s->lookahead == ' '))
|
||||
return (lex_skip(115, lexer, s));
|
||||
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
|
||||
return (lex_advance(490, lexer, s));
|
||||
if ((s->lookahead >= '0' && s->lookahead <= '9'))
|
||||
return (lex_advance(407, lexer, s));
|
||||
if ((s->lookahead != 0 && (s->lookahead > '&' && \
|
||||
s->lookahead < ')') && s->lookahead != ';' && s->lookahead \
|
||||
!= '<' && 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));
|
||||
}
|
||||
|
||||
|
|
@ -33,13 +30,20 @@ bool lex_normal_s116(t_lexer *lexer, t_lexer_state *s)
|
|||
{
|
||||
if (lex_normal_map116(lexer, s))
|
||||
return (true);
|
||||
if (((s->lookahead >= '\t' && s->lookahead <= '\r') || \
|
||||
s->lookahead == ' '))
|
||||
if ((s->lookahead == '\t' || s->lookahead == ' '))
|
||||
return (lex_skip(116, 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(466, 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 \
|
||||
!= '<' && (s->lookahead > '>' && s->lookahead < 'Z') && \
|
||||
s->lookahead != '|'))
|
||||
return (lex_advance(497, lexer, s));
|
||||
return (lex_end_state(lexer, s));
|
||||
}
|
||||
|
||||
|
|
@ -50,45 +54,41 @@ bool lex_normal_s117(t_lexer *lexer, t_lexer_state *s)
|
|||
if ((s->lookahead == '\t' || s->lookahead == ' '))
|
||||
return (lex_skip(117, lexer, s));
|
||||
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
|
||||
return (lex_advance(491, lexer, s));
|
||||
return (lex_advance(467, lexer, s));
|
||||
if ((s->lookahead >= '1' && s->lookahead <= '9'))
|
||||
return (lex_advance(408, lexer, s));
|
||||
return (lex_advance(381, lexer, s));
|
||||
if (((s->lookahead >= 'A' && s->lookahead <= 'Z') || \
|
||||
(s->lookahead >= 'a' && s->lookahead <= 'z')))
|
||||
return (lex_advance(440, lexer, s));
|
||||
return (lex_advance(413, lexer, s));
|
||||
if ((s->lookahead != 0 && (s->lookahead > '&' && \
|
||||
s->lookahead < '*')))
|
||||
return (lex_advance(528, lexer, s));
|
||||
s->lookahead < '*') && s->lookahead != ';' && s->lookahead \
|
||||
!= '<' && (s->lookahead > '>' && s->lookahead < 'Z') && \
|
||||
s->lookahead != '|'))
|
||||
return (lex_advance(497, lexer, s));
|
||||
return (lex_end_state(lexer, s));
|
||||
}
|
||||
|
||||
bool lex_normal_s118(t_lexer *lexer, t_lexer_state *s)
|
||||
{
|
||||
if (lex_normal_map118(lexer, s))
|
||||
return (true);
|
||||
if ((s->lookahead == '\t' || s->lookahead == ' '))
|
||||
return (lex_skip(118, lexer, s));
|
||||
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
|
||||
return (lex_advance(492, lexer, s));
|
||||
if ((s->lookahead >= '0' && s->lookahead <= '9'))
|
||||
return (lex_advance(407, lexer, s));
|
||||
if ((s->lookahead != 0 && (s->lookahead > '&' && \
|
||||
s->lookahead < ')') && s->lookahead != ';' && s->lookahead \
|
||||
!= '<' && s->lookahead != '>' && s->lookahead != '|'))
|
||||
return (lex_advance(528, lexer, s));
|
||||
if (s->lookahead == '\r')
|
||||
return (lex_skip(1, lexer, s));
|
||||
if (s->lookahead == ' ')
|
||||
return (lex_advance(468, lexer, s));
|
||||
if ((s->lookahead >= '\t' && s->lookahead <= '\f'))
|
||||
return (lex_skip(167, lexer, s));
|
||||
if (s->lookahead != 0)
|
||||
return (lex_advance(497, lexer, s));
|
||||
return (lex_end_state(lexer, s));
|
||||
}
|
||||
|
||||
bool lex_normal_s119(t_lexer *lexer, t_lexer_state *s)
|
||||
{
|
||||
if (lex_normal_map119(lexer, s))
|
||||
return (true);
|
||||
if (((s->lookahead >= '\t' && s->lookahead <= '\r') || \
|
||||
if (s->lookahead == '\r')
|
||||
return (lex_skip(1, lexer, s));
|
||||
if (((s->lookahead >= '\t' && s->lookahead <= '\f') || \
|
||||
s->lookahead == ' '))
|
||||
return (lex_skip(119, lexer, s));
|
||||
if (((s->lookahead >= '1' && s->lookahead <= '9') || \
|
||||
(s->lookahead >= 'A' && s->lookahead <= 'Z') || \
|
||||
(s->lookahead >= 'a' && s->lookahead <= 'z')))
|
||||
return (lex_advance(445, lexer, s));
|
||||
return (lex_skip(167, lexer, s));
|
||||
if (s->lookahead != 0)
|
||||
return (lex_advance(497, lexer, s));
|
||||
return (lex_end_state(lexer, s));
|
||||
}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue