Register

GATE CSE 1999 | Question: 1.17

23,337 views
21 votes
21 votes

Which of the following is the most powerful parsing method?

  1. LL (1)
  2. Canonical LR
  3. SLR
  4. LALR
User Avatar

6 Answers

Page:
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

22 votes
22 votes
2 answers
1
Kathleen asked Sep 23, 2014
7,369 views
GATE CSE 1999 | Question: 2.17
Zero has two representations in Sign-magnitude $2's$ complement $1's$ complement None of the above
Zero has two representations inSign-magnitude$2's$ complement$1's$ complementNone of the above
User Avatar
25 votes
25 votes
1 answer
2
Kathleen asked Sep 23, 2014
4,108 views
GATE CSE 1999 | Question: 1.24
Let $R = (A, B, C, D, E, F)$ be a relation scheme with the following dependencies $C \rightarrow F, E \rightarrow A, EC \rightarrow D, A \rightarrow B $. Which one of the following is a key for $R$? CD EC AE AC
Let $R = (A, B, C, D, E, F)$ be a relation scheme with the following dependencies $C \rightarrow F, E \rightarrow A, EC \rightarrow D, A \rightarrow B $. Which one of the...
User Avatar
38 votes
38 votes
1 answer
3
Kathleen asked Sep 23, 2014
16,959 views
GATE CSE 1999 | Question: 1.18, ISRO2016-53
Consider the join of a relation $R$ with a relation $S$. If $R$ has $m$ tuples and $S$ has $n$ tuples then the maximum and minimum sizes of the join respectively are $m+n$ and $0$ $mn$ and $0$ $m+n$ and $|m-n|$ $mn$ and $m+n$
Consider the join of a relation $R$ with a relation $S$. If $R$ has $m$ tuples and $S$ has $n$ tuples then the maximum and minimum sizes of the join respectively are$m+n$...
User Avatar
26 votes
26 votes
2 answers
4
Kathleen asked Sep 23, 2014
9,330 views
GATE CSE 1999 | Question: 1.12
A sorting technique is called stable if it takes $O (n \log n)$ time it maintains the relative order of occurrence of non-distinct elements it uses divide and conquer paradigm it takes $O(n)$ space
A sorting technique is called stable ifit takes $O (n \log n)$ timeit maintains the relative order of occurrence of non-distinct elementsit uses divide and conquer paradi...
User Avatar
Link Copied!