Register
Filter

Recent activity by suryaprakash

1 answer
1
ER tables
Number of tables in case of 1)1:N + total participation (on n side) 2) 1:N + partial participation
Number of tables in case of 1)1:N + total participation (on n side)2) 1:N + partial participation
3 answers
4
ER Diagram to table 2
Please Explain in detail i am weak in this topic
Please Explain in detail i am weak in this topic
1 answer
6
RDMS table
How many minimum Relations required from the following ER Diagram which are satisfy 4 NF?
How many minimum Relations required from the following ER Diagram which are satisfy 4 NF?
2 answers
8
parsing
which of the following statements is true? A) right recursion is needed for termination in predictive parser B) left recursion is required more stack space than right recursion C) left recursion works fine in BUP 1)A & B 2) A & C 3) B & C 4) All
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...
5 answers
11
GATE CSE 1991 | Question: 17,a
Show that the Turing machines, which have a read only input tape and constant size work tape, recognize precisely the class of regular languages.
Show that the Turing machines, which have a read only input tape and constant size work tape, recognize precisely the class of regular languages.
2 answers
13
no of inedequate states in Compiler design
For the below given grammar: S→-S S→S-a S→a The number of inadequate states (states which have conflicts) and number of shift reduce conflicts are _____ and _____ respectively.
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...
1 answer
14
Compiler design
Power of Predictive parser and recursive decent parser is same?
Power of Predictive parser and recursive decent parser is same?
1 answer
16
Is below grammar clr and lalr?
A -> AA+ A -> a I 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.
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.
2 answers
17
LL1 grammer
1 answer
18
Parsing
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 (D) an operator grammar
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(...
6 answers
20
GATE CSE 1987 | Question: 10d
Give a regular expression over the alphabet $\{0, 1\}$ to denote the set of proper non-null substrings of the string $0110$.
Give a regular expression over the alphabet $\{0, 1\}$ to denote the set of proper non-null substrings of the string $0110$.
1 answer
21
Identify the grammar
S $\rightarrow A$ A $\rightarrow AB/$\epsilon$ B $\rightarrow aB/b$ is this grammar LALR(1) ?
S $\rightarrow A$A $\rightarrow AB/$$\epsilon$B $\rightarrow aB/b$is this grammar LALR(1) ?
2 answers
23
VirtualGate-2018-I-19
Consider the grammar given S->AA A->aA / b How many entries will be blank in the GOTO table for SR(0) items? What is the meaning of SR(0) items?
Consider the grammar givenS->AAA->aA / bHow many entries will be blank in the GOTO table for SR(0) items?What is the meaning of SR(0) items?
2 answers
24
Compiler: Bottom Up Parser
Given answer is (D), how?
Given answer is (D), how?
1 answer
26
DFA from reg ex
Construct a finite automata from 0*1*1 + 11*0*1
Construct a finite automata from 0*1*1 + 11*0*1
2 answers
27
regular expressions
Answer is c. but i think it should be b as r1 = (0+1)* = r2=r3. please correct me if i m wrong
Answer is c. but i think it should be b as r1 = (0+1)* = r2=r3. please correct me if i m wrong
2 answers
30
tm has more than 7 states
l = { <M> | M is a TM and M has more than 7 states } Is this decidable /undecidable/R.E /non R.e.??
l = { <M | M is a TM and M has more than 7 states }Is this decidable /undecidable/R.E /non R.e.??