Lecture 28 Parser Contd

Summary

So, this is how the input works that this So, if there is something that then only we will be using that particular transition in the So, these were the four operations that a shift reduce So this, so this way we can rectify the problems and the So, once you have computed the first and sets we can go for constructing the And if you are if you try to modify that look ahead if you want to make it l l k then the So, next we will be looking into another example of this SLR So, we can find out some precedence rule that can that we can be the that can be used for getting an operator precedence Of course, you can you may see that this grammar can be we for this grammar we can make say LR LR 1 So, today we will look into some more examples of these Next, we will be doing a few exercises on working on this L R