-
This program takes the input grammar and converts it into a form without left recursion. This is essential for proper parsing by a top-down parser.
-
Steps to run the program:
cd Section1
g++ qn1.cpp -o qn1
./qn1 input.txt output.txt
Section 2: Program to take a grammar as input and produce equivalent left-factored grammar as output
- Steps to run the program:
cd Section2
g++ qn2.cpp -o qn2
./qn2 input.txt output.txt
- Steps to run the program:
cd Section3
g++ qn3.cpp -o qn3
./qn3 input.txt output.txt