-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathparserDef.h
More file actions
211 lines (197 loc) · 3.54 KB
/
parserDef.h
File metadata and controls
211 lines (197 loc) · 3.54 KB
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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
/*
GROUP 22 :
ID : 2021B3A70995P | Name : Dhruv Ravi Krishnan
ID : 2021B3A70981P | Name : Anirudh Anand
ID : 2021B3A71738P | Name : Akshit Phophaliya
ID : 2022A7PS1182P | Name : Arnav Dham
ID : 2022A7TS0154P | Name : Shaurya Jain
ID : 2022A7PS0187P | Name : Darsh Rathi
*/
#ifndef PARSERDEF_H
#define PARSERDEF_H
#include "lexer.h"
#include "lexerDef.h"
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define NUM_TERMS 60
#define NUM_NONTERMS 53
#define NUM_ELEMENTS 114
enum Elements
{
program,
mainFunction,
otherFunctions,
function,
input_par,
output_par,
parameter_list,
dataType,
primitiveDatatype,
constructedDatatype,
remaining_list,
stmts,
typeDefinitions,
actualOrRedefined,
typeDefinition,
fieldDefinitions,
fieldDefinition,
fieldType,
moreFields,
declarations,
declaration,
global_or_not,
otherStmts,
stmt,
assignmentStmt,
singleOrRecId,
option_single_constructed,
oneExpansion,
moreExpansions,
funCallStmt,
outputParameters,
inputParameters,
iterativeStmt,
conditionalStmt,
elsePart,
ioStmt,
arithmeticExpression,
expPrime,
term,
termPrime,
factor,
highPrecedenceOperator,
lowPrecedenceOperators,
booleanExpression,
var,
logicalOp,
relationalOp,
returnStmt,
optionalReturn,
idList,
more_ids,
definetypestmt,
A,
TKN_ERROR,
TKN_ID,
TKN_NUM,
TKN_END,
TKN_WHILE,
TKN_UNION,
TKN_ENDUNION,
TKN_DEFINETYPE,
TKN_AS,
TKN_TYPE,
TKN_MAIN,
TKN_ASSIGNOP,
TKN_COMMENT,
TKN_FIELDID,
TKN_GLOBAL,
TKN_PARAMETER,
TKN_MUL,
TKN_DIV,
TKN_CALL,
TKN_RECORD,
TKN_GT,
TKN_GE,
TKN_LIST,
TKN_SQL,
TKN_SQR,
TKN_INPUT,
TKN_ENDIF,
TKN_READ,
TKN_WRITE,
TKN_RETURN,
TKN_OUTPUT,
TKN_ENDRECORD,
TKN_ELSE,
TKN_AND,
TKN_OR,
TKN_NOT,
TKN_LT,
TKN_LE,
TKN_EQ,
TKN_INT,
TKN_REAL,
TKN_COMMA,
TKN_SEM,
TKN_COLON,
TKN_DOT,
TKN_ENDWHILE,
TKN_OP,
TKN_CL,
TKN_IF,
TKN_THEN,
TKN_PLUS,
TKN_MINUS,
TKN_RNUM,
TKN_FUNID,
TKN_RUID,
TKN_WITH,
TKN_PARAMETERS,
TKN_NE,
TKN_EPSILON,
TKN_DOLLAR
};
typedef enum Elements Elements;
typedef struct NodeEle
{
Elements item;
struct NodeEle *next;
} node_Ele;
typedef node_Ele *NODE_ELE;
typedef struct LinkedListEle
{
NODE_ELE head;
int count;
} ll_ele;
typedef ll_ele *LL_ELE;
typedef struct NodeLL
{
LL_ELE item;
struct NodeLL *next;
} node_LL;
typedef node_LL *NODE_LL;
typedef struct LinkedListLL
{
NODE_LL head;
int count;
} ll_ll;
typedef ll_ll *LL_Set;
struct Stack
{
LL_ELE list;
};
typedef struct Stack Stack;
typedef struct grammar
{
LL_Set rules[NUM_NONTERMS];
} grammar;
typedef grammar *GRAMMAR;
typedef struct FirstAndFollow
{
LL_ELE firstSet[NUM_ELEMENTS];
LL_ELE followSet[NUM_NONTERMS];
} FirstAndFollow;
typedef struct FirstAndFollow *FIRSTANDFOLLOW;
struct ProdRule
{
Elements LHS;
Elements RHS[10];
int count_rhs;
};
typedef struct ProdRule ProdRule;
struct TreeNode
{
Elements x; // NodeSymbol
int lineNumber; // lineno
char *value; // ValueIfNumber
char *lexeme; // lexeme
struct TreeNode *children[10];
struct TreeNode *parent; // ParentNodeSymbol
int count_children; // isLeafNode
};
typedef struct TreeNode TreeNode;
typedef TreeNode *TREE_NODE;
#endif