Scribd
Upload
2 views

CD_LAB_8

The document describes a C program that implements a predictive parser for checking the validity of input strings in syntax analysis. It outlines the functionality of the parser, including stack operations and the use of a parsing table to determine grammar rules. The program processes an input string and outputs whether it is accepted or not based on the parsing results.

Uploaded by

226m1a0534
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
2 views

CD_LAB_8

The document describes a C program that implements a predictive parser for checking the validity of input strings in syntax analysis. It outlines the functionality of the parser, including stack operations and the use of a parsing table to determine grammar rules. The program processes an input string and outputs whether it is accepted or not based on the parsing results.

Uploaded by

226m1a0534
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 3

/*Aim: Write a C program to check the validity of input string using Predictive

Parser*/

/*Description:
A predictive parser is a type of top-down parser used in the process of syntax
analysis within compilers. It constructs the parse tree for a given input string by
predicting which grammar rules to apply based on the current input symbol and the
current state of the parser. The parser uses a lookahead symbol (typically one or
more tokens) to make decisions about which production rules to use. Predictive
parsers rely on a precomputed parsing table that contains information about which
grammar rules to apply for specific combinations of input symbols and parser
states. They are efficient and avoid backtracking, making them suitable for real-
time parsing applications.
*/

/*Source Code: */
#include <stdio.h>
#include <string.h>

char a[10];
int top = -1, i;

void error() {
printf("Syntax Error");
}

void push(char k[]) {


/* Pushes The Set Of Characters on to the Stack */
for (i = 0; k[i] != '\0'; i++) {
if (top < 9)
a[++top] = k[i];
}
}

char TOS() {
/* Returns TOP of the Stack */
return a[top];
}

void pop() {
/* Pops 1 element from the Stack */
if (top >= 0)
a[top--] = '\0';
}

void display() {
/* Displays Elements Of Stack */
for (i = 0; i <= top; i++)
printf("%c", a[i]);
}

void display1(char p[], int m) {


/* Displays The Present Input String */
int l;
printf("\t");
for (l = m; p[l] != '\0'; l++)
printf("%c", p[l]);
}
char* stack() {
return a;
}

int main() {
char ip[20], r[20], st, an;
int ir, ic, j = 0, k;
char t[5][6][10] = {
"$", "$", "TH", "$", "TH", "$",
"+TH", "$", "e", "e", "$", "e",
"$", "$", "FU", "$", "FU", "$",
"e", "*FU", "e", "e", "$", "e",
"$", "$", "(E)", "$", "i", "$"
};

printf("\nEnter any String(Append with $):");


gets(ip);
printf("Stack\tInput\tOutput\n\n");
push("$E");
display();
printf("\t%s\n", ip);

for (j = 0; ip[j] != '\0';) {


if (TOS() == an) {
pop();
display();
display1(ip, j + 1);
printf("\tPOP\n");
j++;
}
an = ip[j];
st = TOS();
if (st == 'E') ir = 0;
else if (st == 'H') ir = 1;
else if (st == 'T') ir = 2;
else if (st == 'U') ir = 3;
else if (st == 'F') ir = 4;
else {
error();
break;
}
if (an == '+') ic = 0;
else if (an == '*') ic = 1;
else if (an == '(') ic = 2;
else if (an == ')') ic = 3;
else if ((an >= 'a' && an <= 'z') || (an >= 'A' && an <= 'Z')) {
ic = 4;
an = 'i';
} else if (an == '$') ic = 5;

strcpy(r, strrev(t[ir][ic]));
strrev(t[ir][ic]);
pop();
push(r);
if (TOS() == 'e') {
pop();
display();
display1(ip, j);
printf("\t%c->%c\n", st, 238);
} else {
display();
display1(ip, j);
printf("\t%c->%s\n", st, t[ir][ic]);
}
if (TOS() == '$' && an == '$')
break;
if (TOS() == '$') {
error();
break;
}
}

k = strcmp(stack(), "$");
if (k == 0)
printf("\n Given String is accepted");
else
printf("\n Given String is not accepted");

return 0;
}
/*
Output:

Enter any String(Append with $):i+i$


Stack Input Output

$E i+i$
$HT i+i$ E->TH
$HUF i+i$ T->FU
$HUi i+i$ F->i
$HU +i$ POP
$H +i$ U->ε
$HT+ +i$ H->+TH
$HT i$ POP
$HUF i$ T->FU
$HUi i$ F->i
$HU $ POP
$H $ U->ε
$ $ H->ε

Given String is accepted


*/

You might also like