Changed Grammar
This commit is contained in:
parent
b0da66b7d8
commit
fbb9977f4a
2132 changed files with 110314 additions and 233488 deletions
|
|
@ -14,45 +14,86 @@
|
|||
|
||||
bool lex_normal_s200(t_lexer *lexer, t_lexer_state *s)
|
||||
{
|
||||
if (s->lookahead == '&')
|
||||
return (lex_advance(240, lexer, s));
|
||||
if (s->lookahead == ';')
|
||||
return (lex_advance(239, lexer, s));
|
||||
if (lex_normal_map200(lexer, s))
|
||||
return (true);
|
||||
if (((s->lookahead >= '\t' && s->lookahead <= '\r') || \
|
||||
s->lookahead == ' '))
|
||||
return (lex_skip(200, 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_s201(t_lexer *lexer, t_lexer_state *s)
|
||||
{
|
||||
if (s->lookahead == '\'')
|
||||
return (lex_advance(384, lexer, s));
|
||||
if (s->lookahead != 0)
|
||||
return (lex_advance(201, lexer, s));
|
||||
if (lex_normal_map201(lexer, s))
|
||||
return (true);
|
||||
if ((s->lookahead == '\t' || s->lookahead == '\n' || \
|
||||
s->lookahead == ' '))
|
||||
return (lex_skip(201, lexer, s));
|
||||
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
|
||||
return (lex_advance(513, lexer, s));
|
||||
if ((s->lookahead >= '1' && s->lookahead <= '9'))
|
||||
return (lex_advance(404, lexer, s));
|
||||
if ((s->lookahead != 0 && (s->lookahead > '&' && \
|
||||
s->lookahead < ')') && s->lookahead != ';' && s->lookahead \
|
||||
!= '<' && s->lookahead != '{' && s->lookahead != '|'))
|
||||
return (lex_advance(533, lexer, s));
|
||||
return (lex_end_state(lexer, s));
|
||||
}
|
||||
|
||||
bool lex_normal_s202(t_lexer *lexer, t_lexer_state *s)
|
||||
{
|
||||
if (s->lookahead == ')')
|
||||
return (lex_advance(312, lexer, s));
|
||||
if (lex_normal_map202(lexer, s))
|
||||
return (true);
|
||||
if ((s->lookahead == '\t' || s->lookahead == '\n' || \
|
||||
s->lookahead == ' '))
|
||||
return (lex_skip(202, lexer, s));
|
||||
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
|
||||
return (lex_advance(514, lexer, s));
|
||||
if ((s->lookahead >= '1' && s->lookahead <= '9'))
|
||||
return (lex_advance(404, lexer, s));
|
||||
if ((s->lookahead != 0 && (s->lookahead > '&' && \
|
||||
s->lookahead < ')') && s->lookahead != ';' && s->lookahead \
|
||||
!= '<'))
|
||||
return (lex_advance(533, lexer, s));
|
||||
return (lex_end_state(lexer, s));
|
||||
}
|
||||
|
||||
bool lex_normal_s203(t_lexer *lexer, t_lexer_state *s)
|
||||
{
|
||||
if (s->lookahead == '+')
|
||||
return (lex_advance(409, lexer, s));
|
||||
if (s->lookahead == '-')
|
||||
return (lex_advance(399, lexer, s));
|
||||
if (s->lookahead == '=')
|
||||
return (lex_advance(401, lexer, s));
|
||||
if (s->lookahead == '?')
|
||||
return (lex_advance(405, lexer, s));
|
||||
if (lex_normal_map203(lexer, s))
|
||||
return (true);
|
||||
if ((s->lookahead == '\t' || s->lookahead == '\n' || \
|
||||
s->lookahead == ' '))
|
||||
return (lex_skip(203, lexer, s));
|
||||
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
|
||||
return (lex_advance(515, lexer, s));
|
||||
if ((s->lookahead >= '1' && s->lookahead <= '9'))
|
||||
return (lex_advance(404, lexer, s));
|
||||
if ((s->lookahead != 0 && (s->lookahead > '&' && \
|
||||
s->lookahead < ')') && s->lookahead != ';' && s->lookahead \
|
||||
!= '<'))
|
||||
return (lex_advance(533, lexer, s));
|
||||
return (lex_end_state(lexer, s));
|
||||
}
|
||||
|
||||
bool lex_normal_s204(t_lexer *lexer, t_lexer_state *s)
|
||||
{
|
||||
if (s->lookahead == '.')
|
||||
return (lex_advance(314, lexer, s));
|
||||
if (lex_normal_map204(lexer, s))
|
||||
return (true);
|
||||
if ((s->lookahead == '\t' || s->lookahead == '\n' || \
|
||||
s->lookahead == ' '))
|
||||
return (lex_skip(204, lexer, s));
|
||||
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
|
||||
return (lex_advance(516, lexer, s));
|
||||
if ((s->lookahead >= '1' && s->lookahead <= '9'))
|
||||
return (lex_advance(404, lexer, s));
|
||||
if ((s->lookahead != 0 && (s->lookahead > '&' && \
|
||||
s->lookahead < ')') && s->lookahead != ';' && s->lookahead \
|
||||
!= '<' && s->lookahead != '>' && s->lookahead != '|'))
|
||||
return (lex_advance(533, lexer, s));
|
||||
return (lex_end_state(lexer, s));
|
||||
}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue