Created: test main for the parser
This commit is contained in:
Maieul BOYER
parent
c28d673db7
commit
3bde20ba23
10 changed files with 236 additions and 37 deletions
|
|
@ -6,13 +6,13 @@
|
|||
/* By: rparodi <rparodi@student.42.fr> +#+ +:+ +#+ */
|
||||
/* +#+#+#+#+#+ +#+ */
|
||||
/* Created: 2024/03/28 14:40:38 by rparodi #+# #+# */
|
||||
/* Updated: 2024/04/13 17:47:50 by rparodi ### ########.fr */
|
||||
/* Updated: 2024/04/28 18:58:04 by maiboyer ### ########.fr */
|
||||
/* */
|
||||
/* ************************************************************************** */
|
||||
|
||||
#include "../includes/minishell.h"
|
||||
|
||||
t_i32 ft_check_type_operators(t_str operators)
|
||||
t_i32 ft_check_type_operators(t_str operators)
|
||||
{
|
||||
if (operators == NULL)
|
||||
printf("End of input");
|
||||
|
|
@ -45,11 +45,11 @@ t_i32 ft_check_type_operators(t_str operators)
|
|||
return (1);
|
||||
}
|
||||
|
||||
void ft_check(t_utils *shcat, char **input)
|
||||
void ft_check(t_utils *shcat, char **input)
|
||||
{
|
||||
t_usize i;
|
||||
t_usize prev_i;
|
||||
|
||||
t_usize i;
|
||||
t_usize prev_i;
|
||||
|
||||
i = 0;
|
||||
prev_i = 0;
|
||||
while (input[i] != NULL)
|
||||
|
|
@ -69,9 +69,9 @@ void ft_check(t_utils *shcat, char **input)
|
|||
}
|
||||
}
|
||||
|
||||
void ft_take_args(t_utils *shcat)
|
||||
void ft_take_args(t_utils *shcat)
|
||||
{
|
||||
t_i32 i;
|
||||
t_i32 i;
|
||||
|
||||
i = 0;
|
||||
while (1)
|
||||
|
|
@ -85,21 +85,21 @@ void ft_take_args(t_utils *shcat)
|
|||
ft_check(shcat, shcat->strs_input);
|
||||
add_history(shcat->str_input);
|
||||
ft_free_strs(shcat->strs_input);
|
||||
free(shcat->str_input);
|
||||
i++;
|
||||
}
|
||||
free(shcat->str_input);
|
||||
i++;
|
||||
}
|
||||
}
|
||||
|
||||
void ft_init_arge(t_str arge[], t_utils *utils)
|
||||
void ft_init_arge(t_str arge[], t_utils *utils)
|
||||
{
|
||||
size_t i;
|
||||
char *temp;
|
||||
size_t i;
|
||||
char *temp;
|
||||
|
||||
i = 0;
|
||||
temp = NULL;
|
||||
while (arge[i] != NULL)
|
||||
{
|
||||
if (arge[i][0] == 'P' && arge[i][1] == 'A' && arge[i][2] == 'T' && \
|
||||
if (arge[i][0] == 'P' && arge[i][1] == 'A' && arge[i][2] == 'T' &&
|
||||
arge[i][3] == 'H' && arge[i][4] == '=')
|
||||
{
|
||||
temp = ft_strdup(arge[i] + 5);
|
||||
|
|
@ -107,7 +107,7 @@ void ft_init_arge(t_str arge[], t_utils *utils)
|
|||
ft_exit(utils, 1);
|
||||
else
|
||||
utils->path = ft_split(temp, ':');
|
||||
break ;
|
||||
break;
|
||||
}
|
||||
i++;
|
||||
}
|
||||
|
|
@ -115,16 +115,69 @@ void ft_init_arge(t_str arge[], t_utils *utils)
|
|||
free(temp);
|
||||
}
|
||||
|
||||
t_i32 main(t_i32 argc, t_str argv[], t_str arge[])
|
||||
{
|
||||
t_utils *shcat;
|
||||
// t_i32 main(t_i32 argc, t_str argv[], t_str arge[])
|
||||
// {
|
||||
// t_utils *shcat;
|
||||
//
|
||||
// shcat = (t_utils *)ft_calloc(sizeof(t_utils), 1);
|
||||
// if (argc == 2)
|
||||
// shcat->name_shell = ft_strdup(strcat(argv[1], " \001🐱\002 > "));
|
||||
// else
|
||||
// shcat->name_shell = ft_strdup("shcat \001🐱\002 > ");
|
||||
// shcat->envp = arge;
|
||||
// ft_init_arge(arge, shcat);
|
||||
// ft_take_args(shcat);
|
||||
// }
|
||||
|
||||
shcat = (t_utils *)ft_calloc(sizeof(t_utils), 1);
|
||||
if (argc == 2)
|
||||
shcat->name_shell = ft_strdup(strcat(argv[1], " \001🐱\002 > "));
|
||||
else
|
||||
shcat->name_shell = ft_strdup("shcat \001🐱\002 > ");
|
||||
shcat->envp = arge;
|
||||
ft_init_arge(arge, shcat);
|
||||
ft_take_args(shcat);
|
||||
#include "app/node.h"
|
||||
#include "me/string/str_len.h"
|
||||
#include "parser/api.h"
|
||||
#include "parser/parser.h"
|
||||
|
||||
TSLanguage *tree_sitter_bash(void);
|
||||
|
||||
t_node parse_to_nodes(TSParser *parser, t_const_str input)
|
||||
{
|
||||
TSTree *tree;
|
||||
TSNode node;
|
||||
t_node ret;
|
||||
|
||||
tree = ts_parser_parse_string(parser, NULL, input, str_len(input));
|
||||
node = ts_tree_root_node(tree);
|
||||
ret = build_node(node, input);
|
||||
ts_tree_delete(tree);
|
||||
return (ret);
|
||||
}
|
||||
|
||||
void print_node_data(t_node *t, t_usize depth)
|
||||
{
|
||||
t_usize idx;
|
||||
|
||||
idx = 0;
|
||||
while (idx++ < depth)
|
||||
printf("\t");
|
||||
idx = 0;
|
||||
printf("%s = %s\n", t->kind_str, node_getstr(t));
|
||||
while (idx < t->childs_count)
|
||||
print_node_data(&t->childs[idx++], depth + 1);
|
||||
}
|
||||
|
||||
t_i32 main(t_i32 argc, t_str argv[], t_str envp[])
|
||||
{
|
||||
t_str input;
|
||||
TSLanguage *lang;
|
||||
TSParser *parser;
|
||||
t_node root_node;
|
||||
|
||||
(void)(argc);
|
||||
(void)(argv);
|
||||
(void)(envp);
|
||||
lang = tree_sitter_bash();
|
||||
parser = ts_parser_new();
|
||||
ts_parser_set_language(parser, lang);
|
||||
input = "test \n cmd";
|
||||
root_node = parse_to_nodes(parser, input);
|
||||
print_node_data(&root_node, 0);
|
||||
free_node(root_node);
|
||||
ts_parser_delete(parser);
|
||||
}
|
||||
|
|
|
|||
13
shcat_c/sources/node/create_node.c
Normal file
13
shcat_c/sources/node/create_node.c
Normal file
|
|
@ -0,0 +1,13 @@
|
|||
/* ************************************************************************** */
|
||||
/* */
|
||||
/* ::: :::::::: */
|
||||
/* create_node.c :+: :+: :+: */
|
||||
/* +:+ +:+ +:+ */
|
||||
/* By: maiboyer <maiboyer@student.42.fr> +#+ +:+ +#+ */
|
||||
/* +#+#+#+#+#+ +#+ */
|
||||
/* Created: 2024/04/28 18:29:36 by maiboyer #+# #+# */
|
||||
/* Updated: 2024/04/28 18:31:36 by maiboyer ### ########.fr */
|
||||
/* */
|
||||
/* ************************************************************************** */
|
||||
|
||||
#include "parser/api.h"
|
||||
87
shcat_c/sources/node/node.c
Normal file
87
shcat_c/sources/node/node.c
Normal file
|
|
@ -0,0 +1,87 @@
|
|||
/* ************************************************************************** */
|
||||
/* */
|
||||
/* ::: :::::::: */
|
||||
/* node.c :+: :+: :+: */
|
||||
/* +:+ +:+ +:+ */
|
||||
/* By: maiboyer <maiboyer@student.42.fr> +#+ +:+ +#+ */
|
||||
/* +#+#+#+#+#+ +#+ */
|
||||
/* Created: 2024/04/28 18:36:40 by maiboyer #+# #+# */
|
||||
/* Updated: 2024/04/28 18:53:21 by maiboyer ### ########.fr */
|
||||
/* */
|
||||
/* ************************************************************************** */
|
||||
|
||||
#include "app/node.h"
|
||||
#include "me/mem/mem_alloc.h"
|
||||
#include "me/mem/mem_alloc_array.h"
|
||||
#include "me/string/str_l_copy.h"
|
||||
#include "parser/api.h"
|
||||
|
||||
t_node build_node(TSNode curr, t_const_str input);
|
||||
|
||||
t_node *build_childs(TSNode parent, t_const_str input, t_usize count)
|
||||
{
|
||||
t_node *ret;
|
||||
t_usize idx;
|
||||
TSNode child;
|
||||
|
||||
ret = mem_alloc_array(sizeof(*ret), count);
|
||||
if (ret == NULL)
|
||||
return (NULL);
|
||||
idx = 0;
|
||||
while (idx < count)
|
||||
{
|
||||
child = ts_node_named_child(parent, idx);
|
||||
ret[idx] = build_node(child, input);
|
||||
idx++;
|
||||
}
|
||||
return (ret);
|
||||
}
|
||||
|
||||
t_node build_node(TSNode curr, t_const_str input)
|
||||
{
|
||||
t_node out;
|
||||
|
||||
out.kind = ts_node_symbol(curr);
|
||||
out.kind_str = ts_node_type(curr);
|
||||
out.start = ts_node_start_byte(curr);
|
||||
out.end = ts_node_end_byte(curr);
|
||||
out.input = input;
|
||||
out.single_str = NULL;
|
||||
out.childs_count = ts_node_named_child_count(curr);
|
||||
if (out.childs_count == 0)
|
||||
out.childs = NULL;
|
||||
else
|
||||
out.childs = build_childs(curr, input, out.childs_count);
|
||||
return (out);
|
||||
}
|
||||
|
||||
t_str node_getstr(t_node *node)
|
||||
{
|
||||
t_usize start;
|
||||
t_usize end;
|
||||
t_str ret;
|
||||
|
||||
if (node->single_str == NULL)
|
||||
{
|
||||
start = node->start;
|
||||
end = node->end;
|
||||
if (start > end)
|
||||
return (NULL);
|
||||
ret = mem_alloc(end - start + 1);
|
||||
str_l_copy(ret, node->input + start, end - start + 1);
|
||||
node->single_str = ret;
|
||||
}
|
||||
return (node->single_str);
|
||||
}
|
||||
|
||||
void free_node(t_node t)
|
||||
{
|
||||
t_usize idx;
|
||||
|
||||
idx = 0;
|
||||
while (idx < t.childs_count)
|
||||
free_node(t.childs[idx++]);
|
||||
free(t.childs);
|
||||
if (t.single_str != NULL)
|
||||
free(t.single_str);
|
||||
}
|
||||
Loading…
Add table
Add a link
Reference in a new issue