Register

Bottom-Up-Parser

345 views
0 0 votes

Answer the Question with Proper Explanation….

S → Aa / bAc / dc / bda

A → ε

 

The Above Grammar is –

  1. Neither LR(0) nor SLR(1).
  2. LR(0) but not SLR(1).
  3. SLR(1) but not LR(0).
  4. Both LR(0) & SLR(1).

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Made Easy WorkbookNext → · Unacademy Computer O...
← Previous in category · Topics for Compiler ...Next in category → · made easy gate 23 te...
Position:
Show:

Related questions

1 1 vote
1 answers 1 answer
5.6k
5.6k views
Pawan Kumar 7 asked Jun 16, 2018
5,642 views
"A bottom up parser tries to find the right most deviation of the given input in the reverse order
"A bottom up parser tries to find the right most deviation of the given input in the reverse order " what does this line mean Please Explain
3 3 votes
2 answers 2 answers
2.5k
2.5k views
Manu Thakur asked Jan 27, 2018
2,454 views
Compiler: Bottom Up Parser
Given answer is (D), how?\[\mathrm{s} \rightarrow \mathrm{aS} / \mathrm{b}\]The Parsing Automata below is for the context-free grammar with the productions indicated abov...