Register

#compiler-design

• retagged by
1,064 views
3 3 votes
Design predictive parsing table for below grammar.
How many multiple entries are there?

S → AA | ab

A → Bd | ε

B → SB | d

1 Answer

1 1 vote

 

Valid LL(1) Grammars

 

For any production S -> A | B, it must be the case that:

  • For no terminal t could A and B derive strings beginning with t
  • At most one of A and B can derive the empty string
  • if B can derive the empty string, then A does not derive any string beginning with a terminal in Follow(A)
Voting & Accepting an answer helps improve the community
← Previous · CFL or DCFL?Next → · For GATE 2022, then ...
← Previous in category · S->AA/ab A->Bd/null...Next in category → · #compiler-design
Position:
Show:

Related questions

1 1 vote
3 3 answers
2.2k
2.2k views
Crackca asked Sep 19, 2021
2,186 views
#compiler-design
Which of the following statements are true. Please give a detailed explanation.1) If the given grammar is not operator grammar then we can’t design an operator precedenc...
0 0 votes
1 1 answer
422
422 views
Shivani gaikawad asked Jun 3, 2018
422 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...
0 0 votes
1 1 answer
825
825 views
Prince Sindhiya asked May 31, 2018
825 views
compiler design
Consider the grammar G (V, T, P, S) where\[\begin{array}{l}\mathrm{V}=(\mathrm{S}, \mathrm{~A}, \mathrm{~B}), \mathrm{T}=\{\mathrm{a}, \mathrm{~b}\} \mathrm{S}=\{\mathrm{...