91 lines
3.4 KiB
C
91 lines
3.4 KiB
C
/* ************************************************************************** */
|
|
/* */
|
|
/* ::: :::::::: */
|
|
/* state_33.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_s165(t_lexer *lexer, t_lexer_state *s)
|
|
{
|
|
if (s->lookahead == '\r')
|
|
return (lex_skip(87, lexer, s));
|
|
if (((s->lookahead >= '\t' && s->lookahead <= '\f') || \
|
|
s->lookahead == ' '))
|
|
return (lex_skip(189, lexer, s));
|
|
return (lex_end_state(lexer, s));
|
|
}
|
|
|
|
bool lex_normal_s166(t_lexer *lexer, t_lexer_state *s)
|
|
{
|
|
if (s->lookahead == '\r')
|
|
return (lex_skip(88, lexer, s));
|
|
if (((s->lookahead >= '\t' && s->lookahead <= '\f') || \
|
|
s->lookahead == ' '))
|
|
return (lex_skip(192, lexer, s));
|
|
return (lex_end_state(lexer, s));
|
|
}
|
|
|
|
bool lex_normal_s167(t_lexer *lexer, t_lexer_state *s)
|
|
{
|
|
if (lex_normal_map167(lexer, s))
|
|
return (true);
|
|
if ((s->lookahead == '\t' || s->lookahead == '\n' || \
|
|
s->lookahead == ' '))
|
|
return (lex_skip(167, lexer, s));
|
|
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
|
|
return (lex_advance(468, lexer, s));
|
|
if ((s->lookahead >= '1' && s->lookahead <= '9'))
|
|
return (lex_advance(380, lexer, s));
|
|
if (s->lookahead != 0)
|
|
return (lex_advance(497, lexer, s));
|
|
return (lex_end_state(lexer, s));
|
|
}
|
|
|
|
bool lex_normal_s168(t_lexer *lexer, t_lexer_state *s)
|
|
{
|
|
if (lex_normal_map168(lexer, s))
|
|
return (true);
|
|
if ((s->lookahead == '\t' || s->lookahead == '\n' || \
|
|
s->lookahead == ' '))
|
|
return (lex_skip(168, lexer, s));
|
|
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
|
|
return (lex_advance(469, 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 < '*') && s->lookahead != ';' && s->lookahead \
|
|
!= '<'))
|
|
return (lex_advance(497, lexer, s));
|
|
return (lex_end_state(lexer, s));
|
|
}
|
|
|
|
bool lex_normal_s169(t_lexer *lexer, t_lexer_state *s)
|
|
{
|
|
if (lex_normal_map169(lexer, s))
|
|
return (true);
|
|
if ((s->lookahead == '\t' || s->lookahead == '\n' || \
|
|
s->lookahead == ' '))
|
|
return (lex_skip(169, lexer, s));
|
|
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
|
|
return (lex_advance(470, 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 < '*') && s->lookahead != ';' && s->lookahead \
|
|
!= '<'))
|
|
return (lex_advance(497, lexer, s));
|
|
return (lex_end_state(lexer, s));
|
|
}
|