Operator Precedence Parser in Compiler Design || Example 2

[@JAYASRIR-t5g]

Sir, why can't we reduce F to T and T to E in the last step so that our string gets accepted by the grammar?

[@BaladityasaiChinni]

Alakh Pandey of Computer science😊

[@SudhakarAtchala]

Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@kparteearabhi3322]

finally done with the playlist😁

[@SudhakarAtchala]

All the best. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@kishore-hw4wp]

Thanks sir ❤

[@SudhakarAtchala]

Most welcome. Please like the video, subscribe to the channel, and share it with your friends. Thanks in advance.

[@prachi080]

Great explanation , sir !

[@SudhakarAtchala]

Glad you liked it. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@Priyanka-ps8eb]

sir 17:57 for F+T we can reduce F -> T and later T -> E right so that it becomes E+T and we will get the start symbol E am i right sir can u please explain i have an exam tommorow

[@SudhakarAtchala]

F+T is not present in any production, so reduction is not possible. Don't reduce it. Plz subscribe to the channel and if possible share with your friends. Thanks in advance...

[@frootiiiiiiii]

Sir, what should we do if it's not an operator grammar? Is it necessary to convert it to an operator grammar and then continue with the remaining steps?

[@SudhakarAtchala]

yes convert. Plz subscribe to the channel and if possible share with your friends. Thanks in advance...

[@TheSilentLearner786]

Sor where is the parse tree

[@dipkumardas3941]

14:10 sir is T*F and F*T same??

[@SudhakarAtchala]

Yes. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@Bossmanhu]

Sir you teach for ou?

[@SudhakarAtchala]

Syllabus is same for all universities except few topics. Plz subscribe to the channel and if possible share with your friends. Thanks in advance...