Ambiguous Grammar to Unambiguous Conversion| Ambiguity in Compiler how remove ambiguity from grammar

แชร์
ฝัง
  • เผยแพร่เมื่อ 8 ส.ค. 2019
  • Ambiguous grammar to unambiguous grammar conversion is shown here in detail. We will see examples of how to remove ambiguity from ambiguous grammar in compiler design or Theory of Computation (Ambiguous grammar in TOC or CD)
    In this video of CSE concepts with Parinita Hajra, we'll see that what are ambiguous and unambiguous grammar with the help of examples regarding the grammar and parse trees. We'll also see the concept of removing ambiguity from any grammar. #ambiguousGrammar #compilerDesign #ambiguity #ambiguousGrammar #cseconceptwithparinita #cse
    For the people asking me for the equipments I use.... you can buy them from the below links:
    MOBILE: amzn.to/3jdmquc
    LAPTOP: amzn.to/31ontBy
    TRIPOD: amzn.to/2T6V3aC
    MIC: amzn.to/3jl0Jss
    CAMERA: amzn.to/3jmOSdr
    HEADPHONES: amzn.to/2ICLPkn
    POWER BANK: amzn.to/2He3crm
    EARPLUGS: amzn.to/37oK5FQ
    WHITE BOARD: amzn.to/35cAIq0
    If you like my video contents, please LIKE, COMMENT, SUBSCRIBE and SHARE with your friends.
    You can always connect with me at:
    Facebook: / cseconceptswithparinita
    Instagram: / computer_science_concepts
    Whatsapp: chat.whatsapp.com/KH5Kb0FLpia...
    Mail: parinita1995@gmail.com
    Compiler design tutorials:
    • Compiler Design for GA...
    Theory of computation (TOC) tutorials:
    • Theory of computation ...
    Cryptography techniques tutorials:
    • Cryptography Tutorial
    Artificial Intelligence tutorials:
    • AI vs ML vs DL vs data...
    GATE previous year important questions:
    • GATE 2023 important co...
    Data Compression tutorials:
    • Data Compression Tutorial
    Computer networks tutorials:
    • Computer Networks Tuto...
    Technical job updates:
    • Technical job updates
    Database management system tutorials: • DBMS: Database Managem...
    Data structures and Algorithms tutorials:
    • Data Structure and Alg...
    Programming questions:
    • Programming
    Digital image processing:
    • Digital Image Processi...
    Digital electronics:
    • Digital Logic
    Motivational videos:
    • Motivational Video
    Keep learning, keep supporting 🤝✨💯

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

  • @RadheshVayeda
    @RadheshVayeda 4 ปีที่แล้ว +16

    Thank you for this clear explanation

  • @rrahulrroyr
    @rrahulrroyr 4 ปีที่แล้ว +15

    So brief but exactly explained ... Thank you !!

  • @rabindranathhajra168
    @rabindranathhajra168 4 ปีที่แล้ว +10

    Excellent explanation 👌

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

    thank you for the easy explanation

  • @SanjaySingh-ud5ju
    @SanjaySingh-ud5ju 4 ปีที่แล้ว +4

    Mam ur pronunciation is very clear

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

    Very deep explaination!!! Thanks a lot :)

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

    Really thank you ❤️ a harvard student ✌🏼

  • @forthehomies7043
    @forthehomies7043 7 หลายเดือนก่อน +1

    Great explanation. Thank you 👍🏻

    • @CSEconceptswithParinita
      @CSEconceptswithParinita  7 หลายเดือนก่อน +1

      Glad it was helpful! Keep learning, keep supporting 😊

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

    Thank you very muuuuch!
    This will help me greatly at my assignments!

  • @somdipmetia6647
    @somdipmetia6647 4 ปีที่แล้ว +8

    Thank u mam for this awesome explanation

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

    Mam !! How can you generate the last equation

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

    thanks a lot mam

  • @user-ln4bq3dp3b
    @user-ln4bq3dp3b 2 ปีที่แล้ว +3

    Greatest teaching more than my prof at my fucking college teacher.
    Thank you so much.

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

    Thanks ma'am,so virtually when we want to convert an ambiguous grammar to non ambiguous we apply the associative and precidence rule and we see which is wrong and try to make it ambiguous right ma'am?
    So we should always use E gives E + T to make it follow precidence rule right?

    • @CSEconceptswithParinita
      @CSEconceptswithParinita  3 ปีที่แล้ว +3

      Right

    • @Urielbluetv
      @Urielbluetv 3 ปีที่แล้ว

      @@CSEconceptswithParinita
      Great! I got it... Please do you have a video on computer architecture

  • @saiprasadpattapagala5981
    @saiprasadpattapagala5981 3 ปีที่แล้ว +3

    The grammar is also unambiguous

  • @aks6112
    @aks6112 3 ปีที่แล้ว +3

    Mem this is left recursion ?

    • @CSEconceptswithParinita
      @CSEconceptswithParinita  3 ปีที่แล้ว +1

      I have already uploaded a dedicated video on left recursion....you can search and watch that :)

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

    Can you solved this why this is ambiguous, given the problem stated below
    E=E+E*E
    E=E+E
    E=E*E
    E={E}
    E=a

    • @RagHue-tr8cuk
      @RagHue-tr8cuk 4 หลายเดือนก่อน

      Bro just draw a parse tree to know why

  • @sadhvikreddy7917
    @sadhvikreddy7917 3 ปีที่แล้ว +4

    Superb

  • @a.screations8693
    @a.screations8693 ปีที่แล้ว +1

    Myruh

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

    shit, everyone just did a same example 🐽