Register
Filter

Answers by Kaushik.P.E

0 votes
64
doubt
1 votes
65
doubt
0 votes
66
Compiler
Consider the following grammar 1)Left Recursive 2)Ambiguos 3)Left factored 4)None of these
Consider the following grammar1)Left Recursive2)Ambiguos3)Left factored4)None of these
0 votes
67
Machine instructions
Q15 I am having confusion regarding indirect bit(mode bit) .Are mode bit used in deciding number of operations possible?
Q15 I am having confusion regarding indirect bit(mode bit) .Are mode bit used in deciding number of operations possible?
0 votes
68
Dbms Joins
Joins and Cross products are associative or commutative?
Joins and Cross products are associative or commutative?
0 votes
69
parsing
consider the following grammar production S->XX X->0X|1 In the canonical LR method if [X->0•X,0] is an item then which of the following is the viable prefix of the item? a)000 b)111 c) 011 d)110
consider the following grammar productionS->XXX->0X|1In the canonical LR method if [X->0•X,0] is an item then which of the following is the viable prefix of the item?a)...
4 votes
71
# pointer
would the following program give compilation error or warning? <yes/no> main() { float i=10, *j; void *k; k=&i; j=k; printf("\n%f",*j); }
would the following program give compilation error or warning? <yes/no>main() { float i=10, *j; void *k; k=&i; j=k; printf("\n%f",*j);}
0 votes
73
Regular language.
Set of all lexical error produced by compiler is regular or not. I think it is regular,beacuse it should be finite. Plz explain if anything else.
Set of all lexical error produced by compiler is regular or not. I think it is regular,beacuse it should be finite. Plz explain if anything else.
Page: