-
Notifications
You must be signed in to change notification settings - Fork 0
/
syntax_error.c
77 lines (70 loc) · 2.26 KB
/
syntax_error.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* syntax_error.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: seojchoi <seojchoi@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2023/08/06 12:41:19 by seojchoi #+# #+# */
/* Updated: 2023/09/17 14:03:09 by seojchoi ### ########.fr */
/* */
/* ************************************************************************** */
#include "minishell.h"
int syntax_exit(void)
{
g_stat = 258;
return (1);
}
int is_and(char *content)
{
char *and;
and = ft_strdup("&&");
if (ft_strcmp(content, and) == 0)
{
printf("syntax error `&&'\n");
free(and);
return (1);
}
free(and);
return (0);
}
int syntax_errors(t_node *p, t_list *list)
{
if (is_and(p->content))
return (syntax_exit());
if ((p->next) && p->next->type == HEREDOC_IN && p->type == HEREDOC_IN)
return (printf("syntax error '<'\n"), syntax_exit());
if ((p->next) && ((p->next->type == REDIR_IN && p->type == REDIR_IN) || \
(p->next->type == REDIR_OUT && p->type == REDIR_OUT) || \
(p->next->type == HEREDOC_OUT && p->type == HEREDOC_OUT) || \
(p->next->type == PIPE && p->type == PIPE)))
{
printf("syntax error '%s%s' \n", p->content, p->next->content);
return (syntax_exit());
}
if ((p->type == REDIR_IN || p->type == REDIR_OUT || \
p->type == HEREDOC_IN || p->type == HEREDOC_OUT)
&& (p->next == NULL || (p->next && p->next->type != WORD)))
{
printf("syntax error near unexpected token `newline'\n");
return (syntax_exit());
}
if ((p == list->head || p->next == NULL) && p->type == PIPE)
{
printf("syntax error near unexpected token `|'\n");
return (syntax_exit());
}
return (0);
}
int check_syntax_error(t_list *list)
{
t_node *p;
p = list->head;
while (p)
{
if (syntax_errors(p, list))
return (1);
p = p->next;
}
return (0);
}