Here we show how to create a context-free grammar for the union and concatenation of any two context-free languages, as well as the star of one such language. The great part of these operations is that the grammars for them can be generated really easily, just by considering the start variables of the original two grammars (and potentially renaming variables).
Easy Theory Website: www.easytheory.org
Discord: / discord
If you like this content, please consider subscribing to my channel: / @easytheory
▶ABOUT ME◀
I am a professor of Computer Science, and am passionate about it. I have taught many courses at several different universities, including several sections of undergraduate and graduate theory-level classes.
The views expressed in this video are not reflective of any of my current or former employers.
Негізгі бет Context-Free Grammar (CFG) Example: Union/Concat/Star
Пікірлер: 2