Register

test series

• retagged by
1,601 views
1 1 vote
How many DFA states are constructed for the following augmented grammar using LR(0) parser?

S'->S$

S->x|(A)

A->A,S|S

Where S is the start symbol and S′ → S$ is augmented production.

i got 11 state but ans is 10 . can you plz explain i don't know where i am wrong

1 Answer

0 0 votes
but, why are we going from state I1 to state I4? Is state I4  necessary state or it should be removed? Someone help me clearing this doubt.
Voting & Accepting an answer helps improve the community
← Previous · ALGORITHMNext → · Non-Deterministic PD...
← Previous in category · FOLLOWNext in category → · Parsing
Position:
Show:

Related questions

0 0 votes
1 1 answer
434
434 views
Shivani gaikawad asked Jun 3, 2018
434 views
compiler design
How many states are there in CLR parsing table for the given grammar? $\qquad$\[\mathrm{S} \rightarrow \mathrm{~S} \mathrm{~S}+\left|\mathrm{S} \mathrm{~S}^{*}\right| \ma...
1 1 vote
1 1 answer
641
641 views
Rajesh Raj asked Oct 9, 2016
641 views
self_doubt
Consider the following grammar :\[\begin{array}{l}S \rightarrow A a|b A c| d c \mid b d a \\A \rightarrow d\end{array}\]The number of states present in LALR(1) parser is ...
0 0 votes
1 1 answer
543
543 views
asu asked Jan 7, 2016
543 views
parsing
In the grammar given below, sum of number of error states and conflicting states is. $\qquad$Consider Non-recursive Predictive parsing table and 'S' as start symbol.\[\be...
0 0 votes
2 2 answers
689
689 views
Deepalitrapti asked Jul 19, 2018
689 views
Compiler design
8:14 AM37\%Deepali bansal's doubt7 hrsJaipurCompiler DesignCS \& IT EnggWhere €,; IF THEN and all capital letters are terminal and stmt, ifstmt, whilestmt and bexpr are n...