Register

Parser

• retagged by
790 views
1 votes
1 votes
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
• retagged by
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
4 answers
1
Rahul_Rathod_ asked Jan 21, 2019
3,590 views
clr(1) parser
grammar is CLR(1) or not? if yes then how?
grammar is CLR(1) or not?if yes then how?
User Avatar
2 votes
2 votes
0 answers
2
Na462 asked Jan 19, 2019
900 views
LALR(1) Parser
Which one of the following is true about LALR(1) Parser ? It can resolve SR Conflict in favor of reduced It can resolve SR Conflict in favor of Shift It can resolve RR Conflict in favor of reduced It can resolve RR Conflict in favor of shift
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...
User Avatar
1 votes
1 votes
1 answer
3
baghel263 asked Jan 17, 2019
1,009 views
conflicts in parser
does augmented production causes conflicts
does augmented production causes conflicts
User Avatar
Link Copied!