0 votes
1
Number of tables in case of 1)1:N + total participation (on n side)2) 1:N + partial participation
0 votes
4
Please Explain in detail i am weak in this topic
3 votes
6
How many minimum Relations required from the following ER Diagram which are satisfy 4 NF?
0 votes
8
which of the following statements is true?A) right recursion is needed for termination in predictive parserB) left recursion is required more stack space than right recur...
0 votes
10
Show that the Turing machines, which have a read only input tape and constant size work tape, recognize precisely the class of regular languages.
0 votes
12
For the below given grammar:S→-SS→S-aS→aThe number of inadequate states (states which have conflicts) and number of shift reduce conflicts are _____ and _____ respe...
0 votes
13
Power of Predictive parser and recursive decent parser is same?
0 votes
15
A - AA+A - aI think it's both clr and lalr . Can someone draw the diagram and answer it please because I want to verify the lookaheads of some states.
0 votes
16
0 votes
17
The grammar $A\rightarrow AA|\left ( A \right )|\epsilon$ is not suitable for predictive parsing because the grammar is(A) Ambiguous(B) Left Recursive(C) Right Recursive(...
0 votes
18
S $\rightarrow A$A $\rightarrow AB/$$\epsilon$B $\rightarrow aB/b$is this grammar LALR(1) ?
2 votes
19
–1 votes
22
l = { <M | M is a TM and M has more than 7 states }Is this decidable /undecidable/R.E /non R.e.??
0 votes
28