89 lines
3.4 KiB
C
89 lines
3.4 KiB
C
/* ************************************************************************** */
|
|
/* */
|
|
/* ::: :::::::: */
|
|
/* state_25.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_s125(t_lexer *lexer, t_lexer_state *s)
|
|
{
|
|
if (lex_normal_map125(lexer, s))
|
|
return (true);
|
|
if ((s->lookahead == '\t' || s->lookahead == ' '))
|
|
return (lex_skip(125, lexer, s));
|
|
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
|
|
return (lex_advance(501, 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->lookahead != 0 && (s->lookahead > '&' && \
|
|
s->lookahead < '*') && s->lookahead != ';' && s->lookahead \
|
|
!= '<' && (s->lookahead > '>' && s->lookahead < 'Z') && \
|
|
s->lookahead != '|'))
|
|
return (lex_advance(533, lexer, s));
|
|
return (lex_end_state(lexer, s));
|
|
}
|
|
|
|
bool lex_normal_s126(t_lexer *lexer, t_lexer_state *s)
|
|
{
|
|
if (lex_normal_map126(lexer, s))
|
|
return (true);
|
|
if ((s->lookahead == '\t' || s->lookahead == ' '))
|
|
return (lex_skip(126, lexer, s));
|
|
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
|
|
return (lex_advance(502, 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->lookahead != 0 && (s->lookahead > '&' && \
|
|
s->lookahead < '*') && s->lookahead != ';' && s->lookahead \
|
|
!= '<' && (s->lookahead > '>' && s->lookahead < 'Z') && \
|
|
s->lookahead != '|'))
|
|
return (lex_advance(533, lexer, s));
|
|
return (lex_end_state(lexer, s));
|
|
}
|
|
|
|
bool lex_normal_s127(t_lexer *lexer, t_lexer_state *s)
|
|
{
|
|
if (s->lookahead == '\r')
|
|
return (lex_skip(1, lexer, s));
|
|
if (s->lookahead == ' ')
|
|
return (lex_advance(503, lexer, s));
|
|
if ((s->lookahead >= '\t' && s->lookahead <= '\f'))
|
|
return (lex_skip(183, lexer, s));
|
|
if (s->lookahead != 0)
|
|
return (lex_advance(533, lexer, s));
|
|
return (lex_end_state(lexer, s));
|
|
}
|
|
|
|
bool lex_normal_s128(t_lexer *lexer, t_lexer_state *s)
|
|
{
|
|
if (s->lookahead == '\r')
|
|
return (lex_skip(1, lexer, s));
|
|
if (((s->lookahead >= '\t' && s->lookahead <= '\f') || \
|
|
s->lookahead == ' '))
|
|
return (lex_skip(183, lexer, s));
|
|
if (s->lookahead != 0)
|
|
return (lex_advance(533, lexer, s));
|
|
return (lex_end_state(lexer, s));
|
|
}
|
|
|
|
bool lex_normal_s129(t_lexer *lexer, t_lexer_state *s)
|
|
{
|
|
if (s->lookahead == '\r')
|
|
return (lex_advance(400, lexer, s));
|
|
if (s->lookahead != 0)
|
|
return (lex_advance(399, lexer, s));
|
|
return (lex_end_state(lexer, s));
|
|
}
|