-
Notifications
You must be signed in to change notification settings - Fork 0
/
linkedlist.h
58 lines (42 loc) · 1.42 KB
/
linkedlist.h
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
#ifndef LINKEDLIST_H
#define LINKEDLIST_H
#include "lexerDef.h"
#include "grammarDef.h"
#include <stdbool.h>
struct node
{
int tnt;//0 is terminal i.e. token and 1 is non terminal
union {
token t_val;
NT nt_val;
} val;
struct node *next;
};
typedef struct node node;
typedef node * NODE;
struct linked_list
{
int rule_no;
NT nt_val;
NODE head;
};
typedef struct linked_list linked_list;
typedef linked_list * RULE;
RULE createNewRule(NT nt_val, int n);
// This function allocates memory for a new list and returns a pointer to it.
NODE createNewTerm(token t_val, NT nt_val, int n);
// This function allocates memory for a new node and returns a pointer to it.
// The next pointer is set to NULL and the data is set to the value passed in.
void insertNodeIntoRule(NODE node, RULE rule);
// This function inserts a node at the beginning of the list.
void removeFirstNode(RULE rule);
// This function removes the first node from the list.
// void insertNodeAtEnd(NODE node, LIST list); // Not required for stack. Required for Queue
// This function inserts a node at the end of the list.
void destroyList(RULE rule);
void addTermToRule(RULE rule, token t_val, NT nt_val, int tnt);
//function adds term to the rule at right
void printRule(RULE rule);
void addTermToSet(NODE node, NODE set);
int findTermInSet(token term, NODE node);
#endif