Register

UGC NET CSE | June 2014 | Part 2 | Question: 07

• retagged by
1,316 views

1 Answer

Best answer
2 votes
2 votes
D -- NON OF THESE.

THE GRAMMER NOT ONLY NEED TO BE FREE FROM LEFT RECURSION AND LEFT FACTORING BUT ALSO IT NEED TO BE FREE FROM AMBIGUITY
• selected by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
3 answers
1
makhdoom ghaya asked Jun 8, 2016
4,707 views
UGC NET CSE | June 2014 | Part 2 | Question: 08
A shift reduce parser suffers from Shift reduce conflict only Reduce reduce conflict only Both shift reduce conflict and reduce reduce conflict Shift handle and reduce handle conflicts
A shift reduce parser suffers from Shift reduce conflict only Reduce reduce conflict only Both shift reduce conflict and reduce reduce conflict Shift handle and reduce ha...
User Avatar
0 votes
0 votes
2 answers
3
makhdoom ghaya asked Jul 1, 2016
3,408 views
UGC NET CSE | June 2014 | Part 2 | Question: 50
Match the following $:$ ... $\text{a-ii; b-iii; c-i; d-iv}$ $\text{a-iv; b-i; c-ii; d-iii}$
Match the following $:$$\begin{array} {cIcI} & \textbf{List – I} && \textbf{List – II} \\ \text{a.} & \text{DDL} & \text{i.} & \text{LOCK TABLE} \\ \text{b.} & \tex...
User Avatar
2 votes
2 votes
3 answers
4
makhdoom ghaya asked Jul 1, 2016
20,053 views
UGC NET CSE | June 2014 | Part 2 | Question: 49
Let $R =\{A, B, C, D, E, F\}$ be a relation schema with the following dependencies $C \rightarrow F$, $E \rightarrow A$, $EC \rightarrow D$, $A \rightarrow B$. Which of the following is a key for $R$ ? CD EC AE AC
Let $R =\{A, B, C, D, E, F\}$ be a relation schema with the following dependencies $C \rightarrow F$, $E \rightarrow A$, $EC \rightarrow D$, $A \rightarrow B$. Which of t...
User Avatar
Link Copied!