Here we go over the solution to Sipser's 2.9 problem of all strings a^i b^j c^k where either i=j or j=k. The grammar is fairly easy to create, since we can make a CFG for the i=j case, and then another for the j=k case separately. We also prove that this grammar is ambiguous (in fact, any grammar for this language is ambiguous, as I prove here: • An Inherently Ambiguou... .
Thanks to the following supporters of the channel for helping support this video. If you want to contribute, links are below. Names are listed in alphabetical order by surname.
Platinum: Micah Wood
Silver: Simone Glinz, Timmy Gy, Josh Hibschman, Patrik Keinonen, Travis Schnider, and Tao Su
Easy Theory Website: www.easytheory.org
Become a member: / @easytheory
Donation (appears on streams): streamlabs.com/easytheory1/tip
Paypal: paypal.me/easytheory
Patreon: / easytheory
Discord: / discord
Merch:
Language Hierarchy Apparel: teespring.com/language-hierar...
Pumping Lemma Apparel: teespring.com/pumping-lemma-f...
If you like this content, please consider subscribing to my channel: / @easytheory
▶SEND ME THEORY QUESTIONS◀
ryan.e.dougherty@icloud.com
▶ABOUT ME◀
I am a professor of Computer Science, and am passionate about CS theory. I have taught many courses at several different universities, including several sections of undergraduate and graduate theory-level classes.
Негізгі бет Is this Context-Free Grammar ambiguous? (Sipser 2.9 Solution) - Easy Theory
Пікірлер: 6