Consider the following grammar:
E → E+T | T
T → T*F | F
F → (E) | id
Draw a SLR state transition diagram for the above grammar. Also draw the SLR table.
STATE TRANSITION DIAGRAM:
FOLLOW(E)=FOLLOW(E')={),$}
FOLLOW(T)=FOLLOW(T')={+,),$}
FOLLOW(F)={*,+,),$}
SLR PARSING TABLE:
Write short notes on:
What is a priority queue ?
Write a C program to convert any name in short name.
Explain the concept of frequency reuse in cellular systems.
Write a C program to convert any number into word.
Write a C program to print pattern below:
*
* *
* * *
* * * *