Changed Grammar
This commit is contained in:
parent
b0da66b7d8
commit
fbb9977f4a
2132 changed files with 110314 additions and 233488 deletions
|
|
@ -14,94 +14,91 @@
|
|||
|
||||
bool lex_normal_s195(t_lexer *lexer, t_lexer_state *s)
|
||||
{
|
||||
if (s->lookahead == '"')
|
||||
return (lex_advance(373, lexer, s));
|
||||
if (s->lookahead == '#')
|
||||
return (lex_advance(383, lexer, s));
|
||||
if (s->lookahead == '$')
|
||||
return (lex_advance(370, lexer, s));
|
||||
if (lex_normal_map195(lexer, s))
|
||||
return (true);
|
||||
if (s->lookahead == '\\')
|
||||
return (lex_advance(136, lexer, s));
|
||||
return (lex_skip(162, lexer, s));
|
||||
if (s->lookahead == '`')
|
||||
return (lex_advance(416, lexer, s));
|
||||
if ((s->lookahead == '\n' || s->lookahead == '\r'))
|
||||
return (lex_skip(195, lexer, s));
|
||||
if (((s->lookahead >= '\t' && s->lookahead <= '\f') || \
|
||||
return (lex_advance(432, lexer, s));
|
||||
if (s->lookahead == '|')
|
||||
return (lex_advance(272, lexer, s));
|
||||
if (s->lookahead == '~')
|
||||
return (lex_advance(384, lexer, s));
|
||||
if (((s->lookahead >= '\t' && s->lookahead <= '\r') || \
|
||||
s->lookahead == ' '))
|
||||
return (lex_advance(380, lexer, s));
|
||||
if (s->lookahead != 0)
|
||||
return (lex_advance(381, lexer, s));
|
||||
return (lex_skip(195, lexer, s));
|
||||
if ((s->lookahead >= '1' && s->lookahead <= '9'))
|
||||
return (lex_advance(407, lexer, s));
|
||||
if (((s->lookahead >= 'A' && s->lookahead <= 'Z') || \
|
||||
(s->lookahead >= '_' && s->lookahead <= 'z')))
|
||||
return (lex_advance(449, lexer, s));
|
||||
return (lex_end_state(lexer, s));
|
||||
}
|
||||
|
||||
bool lex_normal_s196(t_lexer *lexer, t_lexer_state *s)
|
||||
{
|
||||
if (s->lookahead == '#')
|
||||
return (lex_advance(396, lexer, s));
|
||||
if (s->lookahead == '%')
|
||||
return (lex_advance(352, lexer, s));
|
||||
if (s->lookahead == '+')
|
||||
return (lex_advance(410, lexer, s));
|
||||
if (s->lookahead == '-')
|
||||
return (lex_advance(400, lexer, s));
|
||||
if (s->lookahead == ':')
|
||||
return (lex_advance(203, lexer, s));
|
||||
if (s->lookahead == '=')
|
||||
return (lex_advance(403, lexer, s));
|
||||
if (s->lookahead == '?')
|
||||
return (lex_advance(407, lexer, s));
|
||||
if (s->lookahead == '\\')
|
||||
return (lex_skip(165, lexer, s));
|
||||
if (s->lookahead == '}')
|
||||
return (lex_advance(398, lexer, s));
|
||||
if (lex_normal_map196(lexer, s))
|
||||
return (true);
|
||||
if (((s->lookahead >= '\t' && s->lookahead <= '\r') || \
|
||||
s->lookahead == ' '))
|
||||
return (lex_skip(197, lexer, s));
|
||||
return (lex_skip(196, lexer, s));
|
||||
if (((s->lookahead >= '1' && s->lookahead <= '9') || \
|
||||
(s->lookahead >= 'A' && s->lookahead <= 'Z') || \
|
||||
(s->lookahead >= 'a' && s->lookahead <= 'z')))
|
||||
return (lex_advance(449, lexer, s));
|
||||
return (lex_end_state(lexer, s));
|
||||
}
|
||||
|
||||
bool lex_normal_s197(t_lexer *lexer, t_lexer_state *s)
|
||||
{
|
||||
if (s->lookahead == '#')
|
||||
return (lex_advance(396, lexer, s));
|
||||
if (s->lookahead == '%')
|
||||
return (lex_advance(352, lexer, s));
|
||||
if (s->lookahead == '\\')
|
||||
return (lex_skip(165, lexer, s));
|
||||
if (s->lookahead == '}')
|
||||
return (lex_advance(398, lexer, s));
|
||||
if (lex_normal_map197(lexer, s))
|
||||
return (true);
|
||||
if (((s->lookahead >= '\t' && s->lookahead <= '\r') || \
|
||||
s->lookahead == ' '))
|
||||
return (lex_skip(197, lexer, s));
|
||||
if (((s->lookahead >= '1' && s->lookahead <= '9') || \
|
||||
(s->lookahead >= 'A' && s->lookahead <= 'Z') || \
|
||||
(s->lookahead >= 'a' && s->lookahead <= 'z')))
|
||||
return (lex_advance(449, lexer, s));
|
||||
return (lex_end_state(lexer, s));
|
||||
}
|
||||
|
||||
bool lex_normal_s198(t_lexer *lexer, t_lexer_state *s)
|
||||
{
|
||||
if (s->lookahead == '#')
|
||||
return (lex_advance(421, lexer, s));
|
||||
if (s->lookahead == ')')
|
||||
return (lex_advance(237, lexer, s));
|
||||
if (s->lookahead == '\\')
|
||||
return (lex_skip(169, lexer, s));
|
||||
if (s->lookahead == '`')
|
||||
return (lex_advance(207, lexer, s));
|
||||
if (s->lookahead == '|')
|
||||
return (lex_advance(233, lexer, s));
|
||||
if (((s->lookahead >= '[' && s->lookahead <= ']') || \
|
||||
(s->lookahead >= '{' && s->lookahead <= '}')))
|
||||
return (lex_advance(372, lexer, s));
|
||||
if (((s->lookahead >= '\t' && s->lookahead <= '\r') || \
|
||||
s->lookahead == ' '))
|
||||
if (lex_normal_map198(lexer, s))
|
||||
return (true);
|
||||
if ((s->lookahead == '\n' || s->lookahead == '\r'))
|
||||
return (lex_skip(198, lexer, s));
|
||||
if (((s->lookahead >= '\t' && s->lookahead <= '\f') || \
|
||||
s->lookahead == ' '))
|
||||
return (lex_advance(397, lexer, s));
|
||||
if (((s->lookahead >= '1' && s->lookahead <= '9') || \
|
||||
(s->lookahead >= 'A' && s->lookahead <= 'Z') || \
|
||||
(s->lookahead >= 'a' && s->lookahead <= 'z')))
|
||||
return (lex_advance(449, lexer, s));
|
||||
if ((s->lookahead != 0 && (s->lookahead > ' ' && \
|
||||
s->lookahead < '$') && (s->lookahead > '_' && s->lookahead \
|
||||
< 'z')))
|
||||
return (lex_advance(399, lexer, s));
|
||||
return (lex_end_state(lexer, s));
|
||||
}
|
||||
|
||||
bool lex_normal_s199(t_lexer *lexer, t_lexer_state *s)
|
||||
{
|
||||
if (s->lookahead == '&')
|
||||
return (lex_advance(245, lexer, s));
|
||||
if (s->lookahead == '>')
|
||||
return (lex_advance(261, lexer, s));
|
||||
if (lex_normal_map199(lexer, s))
|
||||
return (true);
|
||||
if (s->lookahead == '\\')
|
||||
return (lex_skip(177, lexer, s));
|
||||
if (s->lookahead == '_')
|
||||
return (lex_advance(482, lexer, s));
|
||||
if (s->lookahead == '}')
|
||||
return (lex_advance(277, lexer, s));
|
||||
if (((s->lookahead >= '\t' && s->lookahead <= '\r') || \
|
||||
s->lookahead == ' '))
|
||||
return (lex_skip(199, lexer, s));
|
||||
if (((s->lookahead >= '1' && s->lookahead <= '9') || \
|
||||
(s->lookahead >= 'A' && s->lookahead <= 'Z') || \
|
||||
(s->lookahead >= 'a' && s->lookahead <= 'z')))
|
||||
return (lex_advance(449, lexer, s));
|
||||
return (lex_end_state(lexer, s));
|
||||
}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue