113 lines
4.2 KiB
C
113 lines
4.2 KiB
C
/* ************************************************************************** */
|
|
/* */
|
|
/* ::: :::::::: */
|
|
/* state_99.c :+: :+: :+: */
|
|
/* +:+ +:+ +:+ */
|
|
/* By: maiboyer <maiboyer@student.42.fr> +#+ +:+ +#+ */
|
|
/* +#+#+#+#+#+ +#+ */
|
|
/* Created: 2024/04/14 19:17:54 by maiboyer #+# #+# */
|
|
/* Updated: 2024/04/14 19:18:20 by maiboyer ### ########.fr */
|
|
/* */
|
|
/* ************************************************************************** */
|
|
|
|
#include "./lex_normal_funcs.h"
|
|
|
|
bool lex_normal_s495(t_lexer *lexer, t_lexer_state *s)
|
|
{
|
|
lex_accept_token(sym_word, lexer, s);
|
|
if (lex_normal_map495(lexer, s))
|
|
return (true);
|
|
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
|
|
return (lex_advance(495, lexer, s));
|
|
if ((s->lookahead >= '1' && s->lookahead <= '9'))
|
|
return (lex_advance(405, lexer, s));
|
|
if (((s->lookahead >= 'A' && s->lookahead <= 'Z') || \
|
|
(s->lookahead >= 'a' && s->lookahead <= 'z')))
|
|
return (lex_advance(443, lexer, s));
|
|
if ((!s->eof && set_contains(sym_word_character_set_1(), \
|
|
9, s->lookahead)))
|
|
return (lex_advance(533, lexer, s));
|
|
return (lex_end_state(lexer, s));
|
|
}
|
|
|
|
bool lex_normal_s496(t_lexer *lexer, t_lexer_state *s)
|
|
{
|
|
lex_accept_token(sym_word, lexer, s);
|
|
if (s->lookahead == '\n')
|
|
return (lex_advance(323, lexer, s));
|
|
if (s->lookahead == '#')
|
|
return (lex_advance(534, lexer, s));
|
|
if (s->lookahead == '-')
|
|
return (lex_advance(520, lexer, s));
|
|
if (s->lookahead == '0')
|
|
return (lex_advance(403, lexer, s));
|
|
if (s->lookahead == '\\')
|
|
return (lex_advance(167, lexer, s));
|
|
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
|
|
return (lex_advance(496, lexer, s));
|
|
if ((s->lookahead >= '1' && s->lookahead <= '9'))
|
|
return (lex_advance(404, lexer, s));
|
|
if ((!s->eof && set_contains(sym_word_character_set_1(), \
|
|
9, s->lookahead)))
|
|
return (lex_advance(533, lexer, s));
|
|
return (lex_end_state(lexer, s));
|
|
}
|
|
|
|
bool lex_normal_s497(t_lexer *lexer, t_lexer_state *s)
|
|
{
|
|
lex_accept_token(sym_word, lexer, s);
|
|
if (lex_normal_map497(lexer, s))
|
|
return (true);
|
|
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
|
|
return (lex_advance(497, lexer, s));
|
|
if ((s->lookahead >= '1' && s->lookahead <= '9'))
|
|
return (lex_advance(405, lexer, s));
|
|
if (((s->lookahead >= 'A' && s->lookahead <= 'Z') || \
|
|
(s->lookahead >= 'a' && s->lookahead <= 'z')))
|
|
return (lex_advance(443, lexer, s));
|
|
if ((!s->eof && set_contains(sym_word_character_set_1(), \
|
|
9, s->lookahead)))
|
|
return (lex_advance(533, lexer, s));
|
|
return (lex_end_state(lexer, s));
|
|
}
|
|
|
|
bool lex_normal_s498(t_lexer *lexer, t_lexer_state *s)
|
|
{
|
|
lex_accept_token(sym_word, lexer, s);
|
|
if (s->lookahead == '\n')
|
|
return (lex_advance(326, lexer, s));
|
|
if (s->lookahead == '#')
|
|
return (lex_advance(534, lexer, s));
|
|
if (s->lookahead == '-')
|
|
return (lex_advance(520, lexer, s));
|
|
if (s->lookahead == '0')
|
|
return (lex_advance(403, lexer, s));
|
|
if (s->lookahead == '\\')
|
|
return (lex_advance(172, lexer, s));
|
|
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
|
|
return (lex_advance(498, lexer, s));
|
|
if ((s->lookahead >= '1' && s->lookahead <= '9'))
|
|
return (lex_advance(404, lexer, s));
|
|
if ((!s->eof && set_contains(sym_word_character_set_1(), \
|
|
9, s->lookahead)))
|
|
return (lex_advance(533, lexer, s));
|
|
return (lex_end_state(lexer, s));
|
|
}
|
|
|
|
bool lex_normal_s499(t_lexer *lexer, t_lexer_state *s)
|
|
{
|
|
lex_accept_token(sym_word, lexer, s);
|
|
if (lex_normal_map499(lexer, s))
|
|
return (true);
|
|
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
|
|
return (lex_advance(499, lexer, s));
|
|
if ((s->lookahead >= '1' && s->lookahead <= '9'))
|
|
return (lex_advance(405, lexer, s));
|
|
if (((s->lookahead >= 'A' && s->lookahead <= 'Z') || \
|
|
(s->lookahead >= 'a' && s->lookahead <= 'z')))
|
|
return (lex_advance(443, lexer, s));
|
|
if ((!s->eof && set_contains(sym_word_character_set_1(), \
|
|
9, s->lookahead)))
|
|
return (lex_advance(533, lexer, s));
|
|
return (lex_end_state(lexer, s));
|
|
}
|