Register

#compiler-design

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

S → AA | ab

A → Bd | ε

B → SB | d
• retagged by
User Avatar

1 Answer

1 votes
1 votes

 

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)
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Shivani gaikawad asked Jun 3, 2018
219 views
compiler design
User Avatar
0 votes
0 votes
1 answer
2
Prince Sindhiya asked May 31, 2018
372 views
compiler design
User Avatar
4 votes
4 votes
1 answer
3
mohitbawankar asked Jan 10, 2018
1,626 views
MOCK TEST compiler design
Consider the given below grammar S→ cAd A→ bA | aA | b If a recursive descent parser is used for string “cbababd” then number of back trackin worst case is:
Consider the given below grammarS→ cAdA→ bA | aA | bIf a recursive descent parser is used for string “cbababd” then number of back trackin worst case is:
User Avatar
5 votes
5 votes
2 answers
4
vishwa ratna asked Jan 18, 2017
2,769 views
Compiler Design
How to do this type of QUESTIONS? Consider following grammar : S → S1 + A | A A → D – A | D D → D1 * B | B B → num The number of internal nodes for the parse tree for 5 * 4 + 10 * 6 – 7 – 8
How to do this type of QUESTIONS?Consider following grammar : S → S1 + A | A A → D – A | D D → D1 * B | B B → num The number of internal nodes for the parse tre...
User Avatar
Link Copied!