ial.h

/*****************************************************************************************
* 
*   IFJ - interpret of IFJ15 language
*
*   ial module header
*   implmementation of algorithms to IAL
*
*   author:     Libor Janíček (xjanic21)
*               Jakup Kolb (xkolbj00)
*   created:    2015-10-30
*   modified:   2015-11-17
*
*****************************************************************************************/

#ifndef IAL_H
#define IAL_H

#include <stdbool.h>
#include "scanner.h"
#include "instlist.h"

// find in 'string' substring 'find'
// returns position of first character of 'find' in 'string'
// if 'string' is empty returns 0, if not found returns -1
// implemented by Knuth-Morris-Pratt alhorithm
int find(char *string, char *search);

// sort characters in 'string'
// use Quick sort algorithm
void sort(char *string);

/****************************************************************************************/

#define SYMBOL_TABLE_SIZE 10

// types of symbols
typedef enum {
    CONST_ST,
	VARIABLE_ST,
    FUNCTION_ST,
} symbolType_T;

typedef struct symbolTableItem symbolTableItem_T;

// symbol table structure
typedef struct symbolTable {
    struct symbolTable *parrent;
    unsigned int count;
    symbolTableItem_T *items[SYMBOL_TABLE_SIZE];
} symbolTable_T;

// symbol structure
typedef struct {
    symbolType_T type;
    dataType_T dataType;
    int count;
    bool defined;
    union {
        int intValue;
        double doubleValue;
        char *stringValue;
        void *data; 
    };
} symbol_T;

// symbol table item
struct symbolTableItem {
    symbol_T data;
    struct symbolTableItem *next;
    char key[];
};

// init 'table'
void initST(symbolTable_T *table);

// destroy 'table' and free all alocated memory
void destroyST(symbolTable_T *table);

// search in 'table' by the 'key'
// return data of table item 
// recursive means that symbol will be search in parrent tables
symbol_T *searchST(symbolTable_T *table, char *key, bool recursive);

// insert in to 'table' item with 'data' and 'key'
// if 'key' exist, will be 'data' updated
// return NULL if fail
symbol_T *insertST(symbolTable_T *table, char *key, symbol_T data);

#endif