85 lines
3.2 KiB
C
85 lines
3.2 KiB
C
/* ************************************************************************** */
|
|
/* */
|
|
/* ::: :::::::: */
|
|
/* state_26.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_s130(t_lexer *lexer, t_lexer_state *s)
|
|
{
|
|
if (lex_normal_map130(lexer, s))
|
|
return (true);
|
|
if (((s->lookahead >= '\t' && s->lookahead <= '\r') || \
|
|
s->lookahead == ' '))
|
|
return (lex_skip(130, lexer, s));
|
|
if ((s->lookahead >= '1' && s->lookahead <= '9'))
|
|
return (lex_advance(387, lexer, s));
|
|
if ((s->lookahead != 0 && (s->lookahead > '&' && \
|
|
s->lookahead < ')') && s->lookahead != ';' && s->lookahead \
|
|
!= '<' && s->lookahead != '>' && (s->lookahead > '{' && \
|
|
s->lookahead < '}')))
|
|
return (lex_advance(482, lexer, s));
|
|
return (lex_end_state(lexer, s));
|
|
}
|
|
|
|
bool lex_normal_s131(t_lexer *lexer, t_lexer_state *s)
|
|
{
|
|
if (lex_normal_map131(lexer, s))
|
|
return (true);
|
|
if (((s->lookahead >= '\t' && s->lookahead <= '\r') || \
|
|
s->lookahead == ' '))
|
|
return (lex_skip(131, lexer, s));
|
|
if ((s->lookahead >= '1' && s->lookahead <= '9'))
|
|
return (lex_advance(387, lexer, s));
|
|
if ((s->lookahead != 0 && (s->lookahead > '&' && \
|
|
s->lookahead < ')') && s->lookahead != ';' && s->lookahead \
|
|
!= '<' && s->lookahead != '>' && (s->lookahead > '{' && \
|
|
s->lookahead < '}')))
|
|
return (lex_advance(482, lexer, s));
|
|
return (lex_end_state(lexer, s));
|
|
}
|
|
|
|
bool lex_normal_s132(t_lexer *lexer, t_lexer_state *s)
|
|
{
|
|
if (lex_normal_map132(lexer, s))
|
|
return (true);
|
|
if (((s->lookahead >= '\t' && s->lookahead <= '\r') || \
|
|
s->lookahead == ' '))
|
|
return (lex_skip(132, lexer, s));
|
|
if ((s->lookahead >= '1' && s->lookahead <= '9'))
|
|
return (lex_advance(387, lexer, s));
|
|
if ((s->lookahead != 0 && (s->lookahead > '&' && \
|
|
s->lookahead < ')') && s->lookahead != ';' && s->lookahead \
|
|
!= '<' && s->lookahead != '>' && (s->lookahead > '{' && \
|
|
s->lookahead < '}')))
|
|
return (lex_advance(482, lexer, s));
|
|
return (lex_end_state(lexer, s));
|
|
}
|
|
|
|
bool lex_normal_s133(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(170, lexer, s));
|
|
if (s->lookahead != 0)
|
|
return (lex_advance(482, lexer, s));
|
|
return (lex_end_state(lexer, s));
|
|
}
|
|
|
|
bool lex_normal_s134(t_lexer *lexer, t_lexer_state *s)
|
|
{
|
|
if (s->lookahead == '\r')
|
|
return (lex_advance(382, lexer, s));
|
|
if (s->lookahead != 0)
|
|
return (lex_advance(381, lexer, s));
|
|
return (lex_end_state(lexer, s));
|
|
}
|