Updated Grammar
This commit is contained in:
parent
74d642f297
commit
175efe0f2f
1246 changed files with 109558 additions and 114993 deletions
|
|
@ -12,102 +12,10 @@
|
|||
|
||||
#include "./lex_normal_funcs.h"
|
||||
|
||||
bool lex_normal_s500(t_lexer *lexer, t_lexer_state *s)
|
||||
bool lex_normal_default(t_lexer *lexer, t_lexer_state *s)
|
||||
{
|
||||
lex_accept_token(sym_word, lexer, s);
|
||||
if (lex_normal_map500(lexer, s))
|
||||
return (true);
|
||||
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
|
||||
return (lex_advance(500, 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_s501(t_lexer *lexer, t_lexer_state *s)
|
||||
{
|
||||
lex_accept_token(sym_word, lexer, s);
|
||||
if (lex_normal_map501(lexer, s))
|
||||
return (true);
|
||||
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
|
||||
return (lex_advance(501, 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_s502(t_lexer *lexer, t_lexer_state *s)
|
||||
{
|
||||
lex_accept_token(sym_word, lexer, s);
|
||||
if (lex_normal_map502(lexer, s))
|
||||
return (true);
|
||||
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
|
||||
return (lex_advance(502, 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_s503(t_lexer *lexer, t_lexer_state *s)
|
||||
{
|
||||
lex_accept_token(sym_word, lexer, s);
|
||||
if (s->lookahead == '!')
|
||||
return (lex_advance(286, lexer, s));
|
||||
if (s->lookahead == '#')
|
||||
return (lex_advance(529, lexer, s));
|
||||
if (s->lookahead == '\\')
|
||||
return (lex_advance(131, lexer, s));
|
||||
if (s->lookahead == '{')
|
||||
return (lex_advance(280, lexer, s));
|
||||
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
|
||||
return (lex_advance(503, 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_s504(t_lexer *lexer, t_lexer_state *s)
|
||||
{
|
||||
lex_accept_token(sym_word, lexer, s);
|
||||
if (s->lookahead == '!')
|
||||
return (lex_advance(286, lexer, s));
|
||||
if (s->lookahead == '#')
|
||||
return (lex_advance(529, lexer, s));
|
||||
if (s->lookahead == '\\')
|
||||
return (lex_advance(133, lexer, s));
|
||||
if (s->lookahead == 'e')
|
||||
return (lex_advance(524, lexer, s));
|
||||
if (s->lookahead == 'f')
|
||||
return (lex_advance(521, lexer, s));
|
||||
if (s->lookahead == '{')
|
||||
return (lex_advance(280, lexer, s));
|
||||
if ((s->lookahead >= 0x0b && s->lookahead <= '\r'))
|
||||
return (lex_advance(504, 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));
|
||||
(void)(lexer);
|
||||
(void)(s);
|
||||
s->result = false;
|
||||
return (false);
|
||||
}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue