Register
Filter

Questions by learner_geek

1 votes
0 answers
33
Closure properties in toc
Please give correct/verified answer.
Please give correct/verified answer.
1 votes
0 answers
34
Draw a DFA for
DFA ???
DFA ???
2 votes
1 answer
35
LR(zero)
Options are as:- (a) i and ii (b) i and iii (c) ii and iii (d) none of the above
Options are as:-(a) i and ii (b) i and iii(c) ii and iii (d) none of the above
1 votes
0 answers
36
CNF and GNF
Given answer is (a) but L->AB i think it is wrong because A and B produce something else Previously, so instead of L->AB there would have given like L->MN M->c1 and N->S then it was correct . if I am wrong please correct me.
Given answer is (a) but L->AB i think it is wrong because A and B produce something else Previously, so instead of L->AB there would have given like L->MN M->c1 and N->S ...
7 votes
6 answers
37
LL(1) Grammar
Which of the following statements is true? Every LL(1) grammar is LALR(1). Every LL(1) grammar is CLR(1). AS I think 2nd is True and 1st is False if I am wrong please let me correct.
Which of the following statements is true?Every LL(1) grammar is LALR(1).Every LL(1) grammar is CLR(1). AS I think 2nd is True and 1st is False if I am wrong please let ...
4 votes
0 answers
38
IN SLR(1) SR CONFLICT
Here what will we do check intersection of follow(S) and follow(B) if common find then declare SR CONFLICT or As S production finish but it's Intersection is only possible with terminal(which is after dot in unfinished production) Please help what to do????
Here what will we do check intersection of follow(S) and follow(B) if common find then declare SR CONFLICT or As S production finish but it's Intersection is only possibl...
1 votes
0 answers
39
SLR one
But given answer SLR(1) if i am wrong let me correct.
But given answer SLR(1) if i am wrong let me correct.
1 votes
1 answer
40
LR(0) OR NOT???
If i am wrong let me correct.
If i am wrong let me correct.
0 votes
1 answer
41
LEFT RECURSION
To avoid left recursion can we do like this. I think this is incorrect way to do
To avoid left recursion can we do like this. I think this is incorrect way to do
2 votes
1 answer
42
Ambiguous to unambiguous
Make this grammer into unambiguous
Make this grammer into unambiguous
1 votes
1 answer
43
LL one
Given answer is yes but i think should not be LL(1)
Given answer is yes but i think should not be LL(1)
1 votes
0 answers
44
UNAMBIGUOUS GRAMMER
If my solution is wrong then please correct it and give proper explanation why it is wrong.
If my solution is wrong then please correct it and give proper explanation why it is wrong.
1 votes
1 answer
45
First and Follow
Example 3.3
Example 3.3
1 votes
0 answers
47
Greibach Normal Form
Is my solution correct?? If not please give reason and correct it.
Is my solution correct?? If not please give reason and correct it.
1 votes
1 answer
49
Basic grammer
A Grammar which is only left recursive or right recursive can be ambiguous grammar??? Or it should have both left recursive and right recursive to be ambiguous???
A Grammar which is only left recursive or right recursive can be ambiguous grammar???Or it should have both left recursive and right recursive to be ambiguous???
1 votes
1 answer
50
Parse tree ambiguous or not
If i am wrong please let me correct with giving proper explanation.
If i am wrong please let me correct with giving proper explanation.
Page: