KEMBAR78
Shift Reduce Parsers Using Stack Allocation | PDF | Computers
Scribd
Upload
50 views4 pages

Shift Reduce Parsers Using Stack Allocation

The document describes a C program to implement shift-reduce parsers using a stack. The program takes the number of productions, non-terminals, right-hand sides (RHS), and input string as input. It creates a stack with '$' at the top and shifts input symbols onto the stack. If the stack matches a RHS, it replaces with the corresponding non-terminal until only '$' remains on the stack and input.

Uploaded by

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

Shift Reduce Parsers Using Stack Allocation

The document describes a C program to implement shift-reduce parsers using a stack. The program takes the number of productions, non-terminals, right-hand sides (RHS), and input string as input. It creates a stack with '$' at the top and shifts input symbols onto the stack. If the stack matches a RHS, it replaces with the corresponding non-terminal until only '$' remains on the stack and input.

Uploaded by

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

6.

Shift Reduce Parsers using Stack allocation


Aim:
To write a C program to implement Shift Reduce Parsers
Algorithm:
Get the no.of productions and the input string
Create a stack with $ symbol at the top of the stack
Push the current input symbol to the stack
If the stack that matches with the right side of the production then replace the RHS with
the corresponding non terminal
Repeat Step 3 & 4 until the input string and stack that contains only $
Display the result
Input:
Enter the no of productions -> 3
Enter the non terminal -> E
Enter the RHS -> E+E
Enter the non terminal -> E
Enter the RHS -> E-E
Enter the non terminal -> E
Enter the RHS -> a
Enter the input symbol ->a+a-a
Output:
STACK INPUT
$ a+a-a$
$a +a-a$
$E +a-a$
$E+ a-a$
$E+a -a$
$E+E -a$
$E -a$
$E- a$
$E-a $
$E-E $
$E $
$ $
Success
Result:

Thus the program for shift reduce parsers is successfully executed and the result is verified .

You might also like