Register

Parser

• retagged by
1,121 views
1 1 vote
construct the LR(0) items for the following grammar S'->S S->+SS|*SS|a Then Select which is not set of the sets of items for this grammar

A)S->a.

B)S->+.SS S->.+SS S->.*SS S->.a

C)S->*S.S

D)S->*S.S

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · time complexityNext → · Digital Counters
← Previous in category · ME-Single Static Ass...Next in category → · Ambiguous grammar
Position:
Show:

Related questions

1 1 vote
4 answers 4 answers
4.8k
4.8k views
Rahul_Rathod_ asked Jan 21, 2019
4,845 views
clr(1) parser
grammar is CLR(1) or not?if yes then how?
2 2 votes
0 0 answers
1.7k
1.7k views
Na462 asked Jan 19, 2019
1,739 views
LALR(1) Parser
Which one of the following is true about LALR(1) Parser ?It can resolve SR Conflict in favor of reducedIt can resolve SR Conflict in favor of ShiftIt can resolve RR Confl...
1 1 vote
1 1 answer
1.5k
1.5k views
baghel263 asked Jan 17, 2019
1,489 views
conflicts in parser
does augmented production causes conflicts
0 0 votes
1 1 answer
596
596 views
Lone Wolf asked Aug 12, 2018
596 views
parser
Consider a Context Free Grammar GI - if G is not Suitable for Top Down Parser then it is also not suitable for LR parsers Family.II - if G is not Suitable for Top Dow...