For the input expression (4*7+1)*2, construct an annotated parse tree.
Explain left factoring with suitable example.
Write short notes on:
Eliminate left recursion from the following grammar:
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.
Show that no left recursive grammar can be LL(1). Show that no LL(1) grammar can be ambiguous.
What is spread spectrum technique? Name two standard spread spectrum techniques and state the main difference in their principles of operation.
What are the differences between destination sequence distance vector and the standard distance vector routing algorithms? What are the frequency bands of operation for CDMA?
Distinguish between software verification and software validation. When during the life cycle verification and validation performed?
Write short notes on
Let R (ABCDE) be a relation schema and consider the following functional dependencies F = { AB→ E, AD→B, B→ C, C →D}. Find out the candidate key.
