108 lines
4 KiB
C
108 lines
4 KiB
C
/* ************************************************************************** */
|
|
/* */
|
|
/* ::: :::::::: */
|
|
/* state_98.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_s490(t_lexer *lexer, t_lexer_state *s)
|
|
{
|
|
lex_accept_token(sym_word, lexer, s);
|
|
if (s->lookahead == '\n')
|
|
return (lex_advance(324, lexer, s));
|
|
if (s->lookahead == '#')
|
|
return (lex_advance(529, lexer, s));
|
|
if (s->lookahead == '\\')
|
|
return (lex_advance(164, lexer, s));
|
|
if (s->lookahead == 'e')
|
|
return (lex_advance(527, lexer, s));
|
|
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
|
|
return (lex_advance(490, lexer, s));
|
|
if ((s->lookahead >= '0' && s->lookahead <= '9'))
|
|
return (lex_advance(407, lexer, s));
|
|
if ((!s->eof && set_contains(sym_word_character_set_1(), \
|
|
9, s->lookahead)))
|
|
return (lex_advance(528, lexer, s));
|
|
return (lex_end_state(lexer, s));
|
|
}
|
|
|
|
bool lex_normal_s491(t_lexer *lexer, t_lexer_state *s)
|
|
{
|
|
lex_accept_token(sym_word, lexer, s);
|
|
if (lex_normal_map491(lexer, s))
|
|
return (true);
|
|
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
|
|
return (lex_advance(491, lexer, s));
|
|
if ((s->lookahead >= '1' && s->lookahead <= '9'))
|
|
return (lex_advance(408, lexer, s));
|
|
if (((s->lookahead >= 'A' && s->lookahead <= 'Z') || \
|
|
(s->lookahead >= 'a' && s->lookahead <= 'z')))
|
|
return (lex_advance(440, lexer, s));
|
|
if ((!s->eof && set_contains(sym_word_character_set_1(), \
|
|
9, s->lookahead)))
|
|
return (lex_advance(528, lexer, s));
|
|
return (lex_end_state(lexer, s));
|
|
}
|
|
|
|
bool lex_normal_s492(t_lexer *lexer, t_lexer_state *s)
|
|
{
|
|
lex_accept_token(sym_word, lexer, s);
|
|
if (s->lookahead == '\n')
|
|
return (lex_advance(327, lexer, s));
|
|
if (s->lookahead == '#')
|
|
return (lex_advance(529, lexer, s));
|
|
if (s->lookahead == '\\')
|
|
return (lex_advance(168, lexer, s));
|
|
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
|
|
return (lex_advance(492, lexer, s));
|
|
if ((s->lookahead >= '0' && s->lookahead <= '9'))
|
|
return (lex_advance(407, lexer, s));
|
|
if ((!s->eof && set_contains(sym_word_character_set_1(), \
|
|
9, s->lookahead)))
|
|
return (lex_advance(528, lexer, s));
|
|
return (lex_end_state(lexer, s));
|
|
}
|
|
|
|
bool lex_normal_s493(t_lexer *lexer, t_lexer_state *s)
|
|
{
|
|
lex_accept_token(sym_word, lexer, s);
|
|
if (lex_normal_map493(lexer, s))
|
|
return (true);
|
|
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
|
|
return (lex_advance(493, lexer, s));
|
|
if ((s->lookahead >= '1' && s->lookahead <= '9'))
|
|
return (lex_advance(408, lexer, s));
|
|
if (((s->lookahead >= 'A' && s->lookahead <= 'Z') || \
|
|
(s->lookahead >= 'a' && s->lookahead <= 'z')))
|
|
return (lex_advance(440, lexer, s));
|
|
if ((!s->eof && set_contains(sym_word_character_set_1(), \
|
|
9, s->lookahead)))
|
|
return (lex_advance(528, lexer, s));
|
|
return (lex_end_state(lexer, s));
|
|
}
|
|
|
|
bool lex_normal_s494(t_lexer *lexer, t_lexer_state *s)
|
|
{
|
|
lex_accept_token(sym_word, lexer, s);
|
|
if (s->lookahead == '\n')
|
|
return (lex_advance(330, lexer, s));
|
|
if (s->lookahead == '#')
|
|
return (lex_advance(529, lexer, s));
|
|
if (s->lookahead == '\\')
|
|
return (lex_advance(175, lexer, s));
|
|
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
|
|
return (lex_advance(494, lexer, s));
|
|
if ((s->lookahead >= '0' && s->lookahead <= '9'))
|
|
return (lex_advance(407, lexer, s));
|
|
if ((!s->eof && set_contains(sym_word_character_set_1(), \
|
|
9, s->lookahead)))
|
|
return (lex_advance(528, lexer, s));
|
|
return (lex_end_state(lexer, s));
|
|
}
|