Updated syntax with a simpler one
This commit is contained in:
parent
38fa2d2e84
commit
aeb576024f
4465 changed files with 195554 additions and 526060 deletions
|
|
@ -14,45 +14,84 @@
|
|||
|
||||
bool lex_normal_s105(t_lexer *lexer, t_lexer_state *s)
|
||||
{
|
||||
if (s->lookahead == '\n')
|
||||
return (lex_advance(901, lexer, s));
|
||||
if (lex_normal_map105(lexer, s))
|
||||
return (true);
|
||||
if (((s->lookahead >= '\t' && s->lookahead <= '\r') || \
|
||||
s->lookahead == ' '))
|
||||
return (lex_skip(105, lexer, s));
|
||||
if ((s->lookahead >= '1' && s->lookahead <= '9'))
|
||||
return (lex_advance(389, lexer, s));
|
||||
if (((s->lookahead >= 'A' && s->lookahead <= 'Z') || \
|
||||
(s->lookahead >= 'a' && s->lookahead <= 'z')))
|
||||
return (lex_advance(432, lexer, s));
|
||||
if ((s->lookahead != 0 && (s->lookahead > '&' && \
|
||||
s->lookahead < '*')))
|
||||
return (lex_advance(482, lexer, s));
|
||||
return (lex_end_state(lexer, s));
|
||||
}
|
||||
|
||||
bool lex_normal_s106(t_lexer *lexer, t_lexer_state *s)
|
||||
{
|
||||
if (s->lookahead == '\n')
|
||||
return (lex_advance(901, lexer, s));
|
||||
if (s->lookahead == '\r')
|
||||
return (lex_advance(105, lexer, s));
|
||||
if (((s->lookahead >= '\t' && s->lookahead <= '\f') || \
|
||||
if (lex_normal_map106(lexer, s))
|
||||
return (true);
|
||||
if (((s->lookahead >= '\t' && s->lookahead <= '\r') || \
|
||||
s->lookahead == ' '))
|
||||
return (lex_skip(264, lexer, s));
|
||||
return (lex_skip(106, lexer, s));
|
||||
if ((s->lookahead >= '1' && s->lookahead <= '9'))
|
||||
return (lex_advance(389, lexer, s));
|
||||
if (((s->lookahead >= 'A' && s->lookahead <= 'Z') || \
|
||||
(s->lookahead >= 'a' && s->lookahead <= 'z')))
|
||||
return (lex_advance(432, lexer, s));
|
||||
if ((s->lookahead != 0 && (s->lookahead > '&' && \
|
||||
s->lookahead < '*') && s->lookahead != ';' && s->lookahead \
|
||||
!= '<'))
|
||||
return (lex_advance(482, lexer, s));
|
||||
return (lex_end_state(lexer, s));
|
||||
}
|
||||
|
||||
bool lex_normal_s107(t_lexer *lexer, t_lexer_state *s)
|
||||
{
|
||||
if (s->lookahead == '\n')
|
||||
return (lex_advance(933, lexer, s));
|
||||
if (lex_normal_map107(lexer, s))
|
||||
return (true);
|
||||
if (((s->lookahead >= '\t' && s->lookahead <= '\r') || \
|
||||
s->lookahead == ' '))
|
||||
return (lex_skip(107, lexer, s));
|
||||
if ((s->lookahead >= '1' && s->lookahead <= '9'))
|
||||
return (lex_advance(389, lexer, s));
|
||||
if (((s->lookahead >= 'A' && s->lookahead <= 'Z') || \
|
||||
(s->lookahead >= 'a' && s->lookahead <= 'z')))
|
||||
return (lex_advance(432, lexer, s));
|
||||
if ((s->lookahead != 0 && (s->lookahead > '&' && \
|
||||
s->lookahead < '*') && s->lookahead != ';' && s->lookahead \
|
||||
!= '<'))
|
||||
return (lex_advance(482, lexer, s));
|
||||
return (lex_end_state(lexer, s));
|
||||
}
|
||||
|
||||
bool lex_normal_s108(t_lexer *lexer, t_lexer_state *s)
|
||||
{
|
||||
if (s->lookahead == '\n')
|
||||
return (lex_advance(933, lexer, s));
|
||||
if (s->lookahead == '\r')
|
||||
return (lex_advance(107, lexer, s));
|
||||
if (((s->lookahead >= '\t' && s->lookahead <= '\f') || \
|
||||
if (lex_normal_map108(lexer, s))
|
||||
return (true);
|
||||
if (((s->lookahead >= '\t' && s->lookahead <= '\r') || \
|
||||
s->lookahead == ' '))
|
||||
return (lex_skip(444, lexer, s));
|
||||
return (lex_skip(108, lexer, s));
|
||||
if (((s->lookahead >= '1' && s->lookahead <= '9') || \
|
||||
(s->lookahead >= 'A' && s->lookahead <= 'Z') || \
|
||||
(s->lookahead >= 'a' && s->lookahead <= 'z')))
|
||||
return (lex_advance(438, lexer, s));
|
||||
return (lex_end_state(lexer, s));
|
||||
}
|
||||
|
||||
bool lex_normal_s109(t_lexer *lexer, t_lexer_state *s)
|
||||
{
|
||||
if (s->lookahead == '\n')
|
||||
return (lex_advance(926, lexer, s));
|
||||
if (lex_normal_map109(lexer, s))
|
||||
return (true);
|
||||
if (((s->lookahead >= '\t' && s->lookahead <= '\r') || \
|
||||
s->lookahead == ' '))
|
||||
return (lex_skip(109, lexer, s));
|
||||
if (((s->lookahead >= '1' && s->lookahead <= '9') || \
|
||||
(s->lookahead >= 'A' && s->lookahead <= 'Z') || \
|
||||
(s->lookahead >= 'a' && s->lookahead <= 'z')))
|
||||
return (lex_advance(438, lexer, s));
|
||||
return (lex_end_state(lexer, s));
|
||||
}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue