Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by kirtikanwar
1
votes
1
answer
21
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)...
1.0k
views
asked
Jan 4, 2017
Compiler Design
compiler-design
viable-prefix
+
–
0
votes
0
answers
22
parsing
Plz explain https://gateoverflow.in/?qa=blob&qa_blobid=17006947629127972543
Plz explainhttps://gateoverflow.in/?qa=blob&qa_blobid=17006947629127972543
181
views
asked
Jan 4, 2017
2
votes
1
answer
23
parsing
Convert the grammar to reduced form ? S->AB S->CA B->BC B->AB A->a C->aB |b
Convert the grammar to reduced form ?S->AB S->CA B->BC B->AB A->a C->aB |b
4.6k
views
asked
Jan 4, 2017
Compiler Design
compiler-design
parsing
context-free-grammar
descriptive
+
–
3
votes
3
answers
24
#GATE
There are 4 sorted lists of n/4 elements each. If we merge these lists into a single sorted list of n elements , for the n=400 number of key comparison in the worst case using an efficient algorithm is?
There are 4 sorted lists of n/4 elements each. If we merge these lists into a single sorted list of n elements , for the n=400 number of key comparison in the worst case ...
415
views
asked
Jan 2, 2017
Algorithms
sorting
algorithms
time-complexity
+
–
Page:
« prev
1
2
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register