Left Recursion & Left factoring | Compiler design -#15

Поделиться
HTML-код
  • Опубликовано: 5 ноя 2024

Комментарии • 8

  • @bncmastermind2842
    @bncmastermind2842 2 дня назад +1

    Madam how did you write the equation got the final equation of example grammer after removing left recursion in it

  • @bncmastermind2842
    @bncmastermind2842 2 дня назад +1

    Mam but you told me that only anonymous grammar can be useful for passing a tree or top down parsing like that but you told me that the example program of after removing the left recursion the total equation you write that he employees a + b + c study epsilon ID that world equation you said that it is ambiguous if it is how ambiguous how can a parasitic can be built or it is suitable for top down parsing

  • @ABHISHEKKUMAR-co7jv
    @ABHISHEKKUMAR-co7jv 4 года назад +1

    Very helpful to enhance our knowledge in a more clear way in this Lockdown....Thank you Ma'am

  • @harshsharma-bx6uh
    @harshsharma-bx6uh 2 года назад +1

    very help full for last night exam purpose

  • @reromsp
    @reromsp 2 года назад +1

    Nice one mam

  • @akhilapasagadugula3250
    @akhilapasagadugula3250 4 года назад +1

    Mam can u please upload converting nfa to minimized dfa?

  • @somasundaram6556
    @somasundaram6556 4 года назад

    nice