Register

Compeler Design LR or SLR
closed

• closed by
294 views
0 votes
0 votes
closed with the note: Wrong question

Consider the following grammar:

With respect to the above grammar, the number of statements that are incorrect are __________ .
S1: Grammar is LR(0).
S2: Grammar is SLR(1).

• closed by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
2 answers
1
Nishu asked Mar 3, 2016
9,455 views
How do we find out whether a given grammer is SLR(1) or LR(0).
Consider the following grammer: S-> aAb | Sc A-> d | Sd | S The above grammer is: a) SLR(1) b) LL(1) c) LR(0) d) none of the above
Consider the following grammer:S- aAb | ScA- d | Sd | SThe above grammer is:a) SLR(1)b) LL(1)c) LR(0)d) none of the above
User Avatar
2 votes
2 votes
4 answers
2
Prashant Gupta asked Sep 8, 2014
5,086 views
Among LR(0), SLR(1) and LALR(1) which parser is going to detect error faster and why??
Among LR(0), SLR(1) and LALR(1) which parser is going to detect error faster and why??
Among LR(0), SLR(1) and LALR(1) which parser is going to detect error faster and why??
User Avatar
2 votes
2 votes
1 answer
4
Anup patel asked Oct 22, 2017
1,064 views
SLR(1) or Not
Whether followingis SLR(1) or Not ? E->E+T/T T->TF/F F->F*/a/b Doubt : While making state you will get one state as I1(E'->E. & E->E.+T ) , is this shift reduce or not ? if not then while making parsing table for LR(0) what will you put in I1 state .... ( All Shift/Reduce Entry as Accept or not) ?
Whether followingis SLR(1) or Not ?E->E+T/TT->TF/FF->F*/a/bDoubt : While making state you will get one state as I1(E'->E. & E->E.+T ) , is this shift reduce or not ?if no...
User Avatar
Link Copied!