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.
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 🙄🙄😒
Back tracking ,back tracking, back tracking.
i dont know how i would complete my degree without your channel .
Meaning of ambuguti the possibility of being understood in more than one way; something that can be understood in more than one way
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.
Maaaa thank you so much
I understood all your tutorials
None gives me a headache
It's very useful ma'am, thanks for your videos as well as your social minded service...
How do you prepare it? Repetitive statements again and again
Better understanding please play with speed 1.25x
Mam try to upload the notes sheet which helps us to revise fast after understanding...
yes ma'am
My brain cells died 😂
Really it's so superb and very clear
Non backtrack
Recursive Descent and table driven
iam totally confuse
I literally understood nothing
🤣😂🤣🤣🤣👍👍👍
Samee
By seeing your comment I feel like going back😣
Exactly
yes😂
Noobs only in comment section.... Such an awesome explanation
haha it's true bruh
Thank you very much❤❤❤❤
nerelere düştük. Selçuk hoca bitirdin bizi
nimda hi
geçmiş olsun fsfasfsaf
i like ur teaching tq
very confusing.. repetition of same sentences again and again..
Thank you❤
This seems similar to binary tree traversal
Why it is recursive descent...hiw can you say akka
Becoz becoz becoz😂😂
Miss Understanding😉
Mam please reorder the sequence
You have wrong preparation.. clearly say
1st manage your work properly and don't go with whole concept at once break down the problem in small pieces
confuse aur kar diya😡
i like your teaching mam,thank u so much ..
So much confusion. Please be clear to yourself first 🙄
TDP
TDP
TTD
TTDC
TTD
TP
TP
TPG
Is this 2017regulation?
Recursive descent mai backtracking nahi hoti hai
Thank you ma'am
mam top down ka draw back ha ?
ma'am confuse kar diya
Maaaa
What about button up parsing ?
Bottom h wo dhakkan lvdde
Pls Lec about TEM
This is absolute trash, just a bunch of repetition
U get confused while teaching improve this
Waaa bete
useles
Tell in telugu madam its is too better to dullers
Channel banalo aur video banao dhana dan
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 🙄🙄😒
😂😂😂
Program tu wargya
Please write the good hand writing.
Not understand
Pls. Don't confuse others ..waste of time
Please restructure. Not clear
parser hota kya hai woo tho btta deti maam
Tq madam
backtracking k baray ma b kuch bta deti yo kya hi bat ho jati
geeksforgeeks
didn't like video, waste of time, your other videos had better explanation with examples
Explaination in english is un understandable urdu language will be better
Can u send sap videos
ma'am please stop uploading videos
what's you age ?
She's 20.
pdhane se phle ek baar khud se pdh liya kro
try to give lectures in your own language,thats why you have less subscribers than other teaching channels
Pagal?
Focus on uour English please i literally didn't understand what you wanna say lol 🥲