Eliminate left recursion from the following grammar:
Show that no left recursive grammar can be LL(1). Show that no LL(1) grammar can be ambiguous.
What is Basic Block? List out the basic blocks and draw the flow graph for the following code:
1. |
location= -1 |
2. |
i=0 |
3. |
i<100 goto 5 |
4. |
goto 13 |
5. |
t1=4*i |
6. |
t2=A[t1] |
7. |
if t2=x goto 9 |
8. |
goto 10 |
9. |
location=i |
10. |
t3=i+1 |
11. |
i=t3 |
12. |
goto 3 |
13. |
… |
Discuss Software Maintenance
What is SRS? Write the features of SRS.
Explain left factoring with suitable example.
Define Quality Planning