solver.c

/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   solver.c                                           :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: ttshivhu <marvin@42.fr>                    +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2017/10/17 10:28:44 by ttshivhu          #+#    #+#             */
/*   Updated: 2017/10/18 09:17:07 by ttshivhu         ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#include "expert.h"

static void     init_list(t_expert **list, char *facts, char *queries)
{
    while (*facts)
    {
        if (add_item(list, *facts, 0, 1) && g_view)
        {
            sleep(1);
            printf("It is given as a fact that \x1b[34m%c\x1b[0m is true\n", *facts);
        }
        facts++;
    }
    while (*queries)
    {
        add_item(list, *queries, 0, 0);
        queries++;
    }
}

static  void    add_alpha_to_stack(t_expert **list, char **rules)
{
    int     i;
    int     j;

    i = -1;
    while (rules[++i])
    {
        j = 0;
        while (rules[i][j])
        {
            if (rules[i][j] <= 'Z' && rules[i][j] >= 'A')
                add_item(list, rules[i][j], 0, 0);
            j++;
        }
    }
}

static int      check_error_in_line(char *line)
{
    int i;

    i = 0;
    while (line[i])
    {
        if (line[i] <= 'Z' && line[i] >= 'A')
            i++;
        else if (line[i] == '(' || line[i] == ')')
            i++;
        else if (line[i] == '+' || line[i] == '|' || line[i] == '^')
            i++;
        else if (ft_strncmp(line + i, "=>", 2) == 0)
            i+=2;
        else if (ft_strncmp(line + i, "<=>", 3) == 0)
            i+=3;
        else if (line[i] == '!')
            i++;
        else
            return (-1);
    }
    return (1);
}

static int     check_error_n_solve(t_expert **list, char **rules, char **error)
{
    int     i;

    i = -1;
    while (rules[++i])
    {
        if (check_error_in_line(rules[i]) == -1)
        {
            *error = ft_strdup(rules[i]);
            return (-1);
        }
    }
    add_alpha_to_stack(list, rules);
    return (1);
}

void            solver(char **rules, char *facts, char *queries)
{
    t_expert    *list;
    char        *error;
    static      int times = 0;

    if (g_view)
        printf("EVALUATING: \x1b[31m%s\x1b[0m\n", queries);
    while (1)
    {
        list = NULL;
        if (times > 0)
                facts = readline("\x1b[34mEnter new facts or \x1b[31m\"exit\"\x1b[34m to quit:\x1b[0m ");
        if (ft_strcmp("exit", facts) == 0)
                break ;
        if (!rule_validate(facts))
        {
            printf("\x1b[31mYou have invalid characters in your facts\x1b[0m\n");
            break ;
        }
        init_list(&list, facts, queries);
        if (check_error_n_solve(&list, rules, &error) == -1)
        {
            printf("Error in line: %s\n", error);
            free(error);
            return ;
        }
        algo(&list, rules);
        if (g_view)
            print_false(list, queries);
        print_results(list, queries);
        free_list(list);
        free(facts);
        times++;
        if (!g_view)
            break ;
    }
}