Question: Consider the grammars: a) o S aaS | bbS | abX | baX | ^ o X aaX | bbX | abS |

 Consider the grammars:
 a)

o S → aaS | bbS | abX | baX | ^
o X → aaX | bbX | abS | baS
 b)

o S → aSbb | abb
c)
o E → E + E | E * E | (E) | 7
o The terminals here are {+, *, (, ), 7}


For each of the above grammars solve the following
1. Show that it is LR(0)
2. If the grammar is LR(0) then Construct LR(0) Table and Execute one word from the language of grammar
3. Show that it is LR(1)
4. If the grammar is LR(1) then Construct LR(1) Table and Execute one word from the language of grammar

Step by Step Solution

3.57 Rating (154 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Computer Engineering Questions!