-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathrdp.c
120 lines (117 loc) · 1.67 KB
/
rdp.c
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
#include<stdio.h>
#include<string.h>
char input[100];
int i=-1,l,st=-1;
// i is used to indicate the current input pointer value and st is current top of the stack
// l holds the length of input string.
char id,num;
void E();
void T();
void F();
void increment();
void Td();
void Ed();
void increment()
{
i++;
if(i<l)
{
if(input[i]>='0'&& input[i]<='9')
{
num=input[i];
id='\0';
}
if((input[i]>='a' || input[i]>='A')&&(input[i]<='z' || input[i]<='Z'))
{
id=input[i];
num='\0';
}
}
}
void E()
{
T();
Ed();
}
void Ed()
{
int p=1;
if(input[i]=='+')
{
p=0;
increment();
T();
Ed();
}
if(input[i]=='-')
{
p=0;
increment();
T();
Ed();
}
// Recursive Descent Parser
if(p==1)
{
}
}
void T()
{
F();
Td();
}
void Td()
{
int p=1;
if(input[i]=='*')
{
p=0;
increment();
F();
Td();
}
if(input[i]=='/')
{
p=0;
increment();
F();
Td();
}
}
void F()
{
if(input[i]==id) {
increment(); }
if(input[i]=='(')
{
increment();
E();
if(input[i]==')')
{
increment();
}
}
if(input[i]==num)
{
increment();
}
}
int main()
{
int i;
printf("Enter Input String ");
scanf("%s",input);
l=strlen(input);
input[l]='$';
increment();
E();
if(i==l)
{
printf("String Accepted\n");
}
else
{
printf("String rejected\n");
}
return 0;
}