Top Down parser | Types of Parser | Compiler Design | Lec - 10 | Bhanu priya

top down parser:
Recursive Descent parsing
- With backtracking
- Without backtracking

[@PankajSharma-rh3eg]

Back tracking ,back tracking, back tracking.

[@milanbhandari9933]

How do you prepare it? Repetitive statements again and again

[@mirzarabia2984]

mam top down ka draw back ha ?

[@060_abhinav7]

i dont know how i would complete my degree without your channel .

[@THOTARethindhar]

Why it is recursive descent...hiw can you say akka

[@ajinkyajadhav8680]

Mam please reorder the sequence

[@machina20]

Maaaa thank you so much I understood all your tutorials None gives me a headache

[@ithalskitchen5086]

It's very useful ma'am, thanks for your videos as well as your social minded service...

[@nithingundeti]

Mam try to upload the notes sheet which helps us to revise fast after understanding...

[@Princy2231]

yes ma'am

[@MsCpktnwt]

Meaning of ambuguti the possibility of being understood in more than one way; something that can be understood in more than one way

[@varammanohar2934]

iam totally confuse

[@Sana-tp6oi]

Is this 2017regulation?

[@avengergamingkmr3262]

Non backtrack Recursive Descent and table driven

[@Princy2231]

Thank you ma'am

[@saptarshichattopadhyay8234]

Thank you very much❤❤❤❤

[@vasum9740]

i like ur teaching tq

[@steamerandy]

Before parser generators we had (impariative) parser programming languages that compiled to executable code and include construction operators. Construction is done on the parse stack. A node stack provides temporary stacked storage of nodes. Token .. formula recognize variable tokens, create and push token objects on the parse stack: number .. dgt $dgt; An expr formula is used to recognize a term or sequance of terms separated be an ADD '+' or SUB '-' operator. expr = term $(('+':ADD|'-":SUB) term !2); In expr term is called to recognize a term. On success we expect the term tree to be the top entry on the parse stack. Continuing we look for a + or -. On recognizing a '+' character :ADD creates an ADD node object and pushes it onto the node stack. Likewise recognizing a '-'. :SUB creates a SUB node and push it onto the node stack. Not recognizing a + or - character the loop completes Given a-b+c expr produces: ADD / \ SUB c / \ a b Above a loop created a left handed tree. Using recursion: expr = term (+':ADD|'-":SUB) expr !2; A right-handed tree is constructed using tail recursion.

[@mertylmaz2448]

nerelere düştük. Selçuk hoca bitirdin bizi

[@deepaksaini9023]

nimda hi

[@ahmetgurses]

geçmiş olsun fsfasfsaf

[@sasikannanp6319]

Pls Lec about TEM

[@sivakumarthirumalasetty8046]

Tq madam

[@dipendrasharma6921]

Thank you❤

[@kavithavasu8456]

Really it's so superb and very clear

[@thakur-fk3vd]

My brain cells died 😂

[@rababzehra159]

very confusing.. repetition of same sentences again and again..

[@TheCrazyRitik]

Noobs only in comment section.... Such an awesome explanation

[@saiavinash4249]

haha it's true bruh

[@machina20]

Maaaa What about button up parsing ?

[@shashankmenghare8960]

Bottom h wo dhakkan lvdde

[@galaxy1575]

Better understanding please play with speed 1.25x

[@animeshchakraborty8685]

i like your teaching mam,thank u so much ..

[@daniyaltayyab2379]

backtracking k baray ma b kuch bta deti yo kya hi bat ho jati

[@kashmirking2446]

Becoz becoz becoz😂😂

[@jinglebellsgowri]

You have wrong preparation.. clearly say

[@Eshh173]

Can u send sap videos

[@vaibhavdevkar7609]

Miss Understanding😉

[@sachinjha4573]

Recursive descent mai backtracking nahi hoti hai

[@Shuvooa]

I literally understood nothing

[@thesumitkumar0]

🤣😂🤣🤣🤣👍👍👍

[@skmiraj70]

Samee

[@user-Vinay_Rudrappa]

By seeing your comment I feel like going back😣

[@kunalverma6911]

Exactly

[@pavithradevi7527]

yes😂

[@shashikalaraju6265]

Please restructure. Not clear

[@Baking_Blitz]

useles

[@arpan9028]

parser hota kya hai woo tho btta deti maam

[@ManishKumar-gb8wh]

confuse aur kar diya😡

[@harshalchavan9626]

geeksforgeeks

[@BHARATKUMAR-le6eq]

ma'am confuse kar diya

[@PankajSharma-rh3eg]

Channel banalo aur video banao dhana dan

[@arinyaalvie8002]

Mam you should watch your own video atleast....earlier you said top down is recursive descent and now you are saying it is a type of top down parsing...i mean 🙄🙄😒

[@vallurudhasthagirammavallu29]

Tell in telugu madam its is too better to dullers

[@rajdeepsendhiya_cs_1134]

So much confusion. Please be clear to yourself first 🙄

[@rahulasrani0816]

U get confused while teaching improve this

[@vinit173]

Waaa bete

[@songforall6191]

😂😂😂 Program tu wargya

[@lazygoose2141]

Pls. Don't confuse others ..waste of time

[@timilehinbakare7263]

This is absolute trash, just a bunch of repetition

[@user-hm2gb6pm6b]

TDP TDP TTD TTDC TTD TP TP TPG

[@zeeshanahmadkhalil8920]

what's you age ?

[@AnkitGupta-pn6od]

She's 20.

[@vbabuvaduguru8154]

Please write the good hand writing. Not understand

[@songforall6191]

1st manage your work properly and don't go with whole concept at once break down the problem in small pieces

[@Abdulwaheed-re4ez]

Explaination in english is un understandable urdu language will be better

[@chirkutchor7866]

didn't like video, waste of time, your other videos had better explanation with examples

[@himanshudixit3376]

ma'am please stop uploading videos

[@sahil1053]

pdhane se phle ek baar khud se pdh liya kro

[@flxplays5584]

try to give lectures in your own language,thats why you have less subscribers than other teaching channels

[@B-girl71.]

Focus on uour English please i literally didn't understand what you wanna say lol 🥲