changed grammar
This commit is contained in:
parent
0b5b5e4d7e
commit
e5b22489e1
1219 changed files with 96283 additions and 113028 deletions
|
|
@ -14,50 +14,90 @@
|
|||
|
||||
bool lex_normal_s215(t_lexer *lexer, t_lexer_state *s)
|
||||
{
|
||||
if (s->lookahead == 'o')
|
||||
return (lex_advance(239, lexer, s));
|
||||
if ((s->lookahead != 0 && (s->lookahead > '\t' && \
|
||||
s->lookahead < '\r')))
|
||||
return (lex_advance(488, lexer, s));
|
||||
return (lex_end_state(lexer, s));
|
||||
}
|
||||
|
||||
bool lex_normal_s216(t_lexer *lexer, t_lexer_state *s)
|
||||
{
|
||||
if (s->lookahead == 's')
|
||||
return (lex_advance(207, lexer, s));
|
||||
if (s->eof)
|
||||
return (lex_advance(232, lexer, s));
|
||||
if (s->lookahead == '\n')
|
||||
return (lex_skip(231, lexer, s));
|
||||
return (lex_end_state(lexer, s));
|
||||
}
|
||||
|
||||
bool lex_normal_s217(t_lexer *lexer, t_lexer_state *s)
|
||||
{
|
||||
if (s->lookahead == '|')
|
||||
return (lex_advance(264, lexer, s));
|
||||
if (s->eof)
|
||||
return (lex_advance(232, lexer, s));
|
||||
if (s->lookahead == '\n')
|
||||
return (lex_skip(218, lexer, s));
|
||||
return (lex_end_state(lexer, s));
|
||||
}
|
||||
|
||||
bool lex_normal_s218(t_lexer *lexer, t_lexer_state *s)
|
||||
{
|
||||
if ((s->lookahead != 0 && (s->lookahead > '\t' && \
|
||||
s->lookahead < '\r')))
|
||||
return (lex_advance(497, lexer, s));
|
||||
if (s->eof)
|
||||
return (lex_advance(232, lexer, s));
|
||||
if (s->lookahead == '\n')
|
||||
return (lex_advance(284, lexer, s));
|
||||
if (s->lookahead == '#')
|
||||
return (lex_advance(400, lexer, s));
|
||||
if (s->lookahead == '&')
|
||||
return (lex_advance(323, lexer, s));
|
||||
if (s->lookahead == ')')
|
||||
return (lex_advance(252, lexer, s));
|
||||
if (s->lookahead == ';')
|
||||
return (lex_advance(490, lexer, s));
|
||||
if (s->lookahead == '<')
|
||||
return (lex_advance(266, lexer, s));
|
||||
if (s->lookahead == '>')
|
||||
return (lex_advance(270, lexer, s));
|
||||
if (s->lookahead == '\\')
|
||||
return (lex_skip(227, lexer, s));
|
||||
if (s->lookahead == '`')
|
||||
return (lex_advance(396, lexer, s));
|
||||
if (s->lookahead == 'e')
|
||||
return (lex_advance(213, lexer, s));
|
||||
if (s->lookahead == 'i')
|
||||
return (lex_advance(211, lexer, s));
|
||||
if (s->lookahead == '|')
|
||||
return (lex_advance(251, lexer, s));
|
||||
if (((s->lookahead >= '\t' && s->lookahead <= '\r') || \
|
||||
s->lookahead == ' '))
|
||||
return (lex_skip(218, lexer, s));
|
||||
return (lex_end_state(lexer, s));
|
||||
}
|
||||
|
||||
bool lex_normal_s219(t_lexer *lexer, t_lexer_state *s)
|
||||
{
|
||||
if (s->eof)
|
||||
return (lex_advance(235, lexer, s));
|
||||
if (lex_normal_map219(lexer, s))
|
||||
return (true);
|
||||
if ((s->lookahead == '\t' || s->lookahead == ' '))
|
||||
return (lex_advance(232, lexer, s));
|
||||
if (s->lookahead == '\n')
|
||||
return (lex_advance(284, lexer, s));
|
||||
if (s->lookahead == '#')
|
||||
return (lex_advance(400, lexer, s));
|
||||
if (s->lookahead == '&')
|
||||
return (lex_advance(323, lexer, s));
|
||||
if (s->lookahead == ')')
|
||||
return (lex_advance(252, lexer, s));
|
||||
if (s->lookahead == ';')
|
||||
return (lex_advance(490, lexer, s));
|
||||
if (s->lookahead == '<')
|
||||
return (lex_advance(266, lexer, s));
|
||||
if (s->lookahead == '>')
|
||||
return (lex_advance(270, lexer, s));
|
||||
if (s->lookahead == '\\')
|
||||
return (lex_skip(228, lexer, s));
|
||||
if (s->lookahead == '`')
|
||||
return (lex_advance(395, lexer, s));
|
||||
if (s->lookahead == '|')
|
||||
return (lex_advance(251, lexer, s));
|
||||
if (((s->lookahead >= '\t' && s->lookahead <= '\r') || \
|
||||
s->lookahead == ' '))
|
||||
return (lex_skip(219, lexer, s));
|
||||
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
|
||||
return (lex_advance(453, 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(497, lexer, s));
|
||||
return (lex_end_state(lexer, s));
|
||||
}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue