Recent activity by Anonymous

3 answers

1

Consider the following SDT. A → BC *(I) B.i = f(A.i) (II) B.i = f(A.S) (III) A.S = f(B.s)
Consider the following SDT. A → BC * (I) B.i = f(A.i) (II) B.i = f(A.S) (III) A.S = f(B.S) which of the above is violating L – attributed definition? (a) I only (b) II only (c) I, II (d) I, II, III

Consider the following SDT.A → BC *(I) B.i = f(A.i) (II) B.i = f(A.S) (III) A.S = f(B.S)which of the above is violating L – attr...

6.8k views

commented Sep 8, 2015

2 answers

2

symbol table search
Access time of the symbol table will be logarithmic, if it is implemented by a linear list search tree hash table none of the above

Access time of the symbol table will be logarithmic, if it is implemented by alinear list search tree hash table none of the above

7.9k views

asked Sep 7, 2015