Top Down Parsers - LL(1) Parsers

แชร์
ฝัง
  • เผยแพร่เมื่อ 11 พ.ย. 2024

ความคิดเห็น • 14

  • @doniakh7482
    @doniakh7482 ปีที่แล้ว +12

    this has helped me more than my 2 hours lecture... thank you so much

  • @kajalsharma5952
    @kajalsharma5952 ปีที่แล้ว +7

    so beautiful , so elegant just looking like a wow! amazing series .......please complete it before jan my end sems a whole hearted request!
    🥺❣

  • @sourabhsharma2511
    @sourabhsharma2511 2 หลายเดือนก่อน

    i really loved the way you connect things this is what missing in many youtube videos , thankyou so much

  • @gatecomputerscience1484
    @gatecomputerscience1484 ปีที่แล้ว +5

    so beautifully explain

  • @dinushachathuranga7657
    @dinushachathuranga7657 8 หลายเดือนก่อน

    Thanks for the nice explanation💜

  • @reyy9220
    @reyy9220 8 หลายเดือนก่อน

    dude thank you soooo much ur a lifesaver

  • @nikhilmaid2670
    @nikhilmaid2670 ปีที่แล้ว +2

    are u gonna complete the aptitude and reasoning playlist??

  • @putawan8911
    @putawan8911 2 หลายเดือนก่อน

    what's the FIRST(A):
    Is it {a,ε} or {a} ?

  • @509nandini7
    @509nandini7 ปีที่แล้ว

    Sir here we no need find the FIRST (A)
    FIRST (B)
    or
    We have to do that...?

  • @omarzakzook6077
    @omarzakzook6077 10 หลายเดือนก่อน +2

    why in the first(S) w didn't put c ??

    • @sahilyadav3782
      @sahilyadav3782 7 หลายเดือนก่อน +2

      because we can't have a c in the first place when S is substituted
      the grammar was
      S -> ABC
      A -> a | e (think of e as epsilon please)
      B -> b
      C -> c
      now, S is substituted by A
      A is then substituted by a, which is a terminal
      So, we can have an `a` at the first position when S is substituted with terminals
      Hence we put `a` in the set of FIRST(S)
      i.e. FIRST(S) = {a}
      Now, A can also be substituted by e(epsilon)
      In this case, when we move ahead with S -> ABC, after A comes B, and B->b (from the grammar)
      Since epsilon means null and is not written in the final string of terminals, in this specific case, when S is substituted, it starts with a `b`
      That means, S can also be substituted by a terminal string which starts with `b`. So we can push `b` in the FIRST(S)
      FIRST(S) = {a, b}
      But in no case can there be a terminal string for S which starts with C, cause B will always derive b, and since B comes before C in S, i.e. S -> ABC, S will always have at least a b before c.
      Hence, there will be no terminal string for S which starts with c, so we don't put c in the FIRST(S)

  • @tomfotografie5831
    @tomfotografie5831 4 หลายเดือนก่อน +2

    is'nt it? ar'nt we? is'nt so? lol