Question
Let G be the augmented grammar of G: 0.E E 1.E E + T 2.E E T 3.ET 4.T T*F 5.T T/F 6.T F 7.F
Let G be the augmented grammar of G:
0.E E
1.E E + T
2.E E T
3.ET
4.T T*F
5.T T/F
6.T F
7.F i
8.F n
9.F (E)
Where i and n stand for an identifier and a number, respectively.
Write a program which generates the following:
1.The set of items (100 points).
2.Transition diagram (50 points). (use a 2-D array)
3.FOLLOW table (50 points).
4.GOTO table (50 points).
5.ACTION table (50 points).
Please follow the following order: G = , N = {E, T, F}, T = { i, n, (, +, -, *, /, ) }
TRANSITION DIAGRAM
TO 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
FROM 0 E T F i n (
1 + -
2 * /
3
4
5
Use the following below to help with this program:
Z) Gene ruteheatofilens. E-> E-T E--> T 79 T/F F-7 (e) ( losure -) . E_T ->. .TIF T->.F F-7,n F, LES -- r il B [IL| pla wa TTTF FF wiulisu geuri T E' E ET, TIFF Z) Gene ruteheatofilens. E-> E-T E--> T 79 T/F F-7 (e) ( losure -) . E_T ->. .TIF T->.F F-7,n F, LES -- r il B [IL| pla wa TTTF FF wiulisu geuri T E' E ET, TIFFStep by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started