Consider the following grammar E-→E or T | T T→ T and F |F F→not F | (E) | true | false (i) Remove left recursion from the grammar. (ii) Construct a predictive parsing table.
Excuse me sir, in third example you've shown for first of S you wrote {a,b}. Is this correct, as ive understood the terminal must come first in order to be chosen in first. Thank you for your help! :*
Yes it's correct. On seesing A it will take first of A which is epsilon so a would be added and in second production rule on seeing B it will take first of B which is epsilon and hence will take next of B that is b...
Superb explanation for LL parsing tables, ty so much ❤
Sir please keep uploading new videos of this series...we have exams in May (final)
how did it go?
How did the exam go ?
Consider the following grammar
E-→E or T | T
T→ T and F |F
F→not F | (E) | true | false
(i) Remove left recursion from the grammar.
(ii) Construct a predictive parsing table.
thank you so so so much
completely usefull
Excuse me sir, in third example you've shown for first of S you wrote {a,b}. Is this correct, as ive understood the terminal must come first in order to be chosen in first. Thank you for your help! :*
Yes it's correct. On seesing A it will take first of A which is epsilon so a would be added and in second production rule on seeing B it will take first of B which is epsilon and hence will take next of B that is b...
❤❤❤❤
Sir, like you said in question one Q3. Has € which has multiple values. How it is considered as LL1 grammar?
Got it
Please upload videoa for LL(0) i have exam next month
1st comment 🥳🥳
3rd comment 😄😄
sir bhakki ka content please upload kigiye 🤖
rgola