Introduction to Context-Free Grammars and Languages (Theory of Computing)
1We explore the concept of grammars and context-free languages, as context-free grammars! Here we discuss how grammars work, which are a special kind of string rewriting system. From there, we explore core terminology, and how we can visualize derivations through parse trees (partially or completely). We finally define what a context-free language is at the end.
Time Stamps:
0:00 Recap about languages, primer for our discussion
4:50 General terminology of grammars and how context-free grammars work, derivations.
29:20 Parse trees (partial or a complete derivation)
43:07 Some remarks about writing our grammars
51:35 What is a context-free grammar? Definition
58:49 Another example of a context-free grammar
1:05:13 Language of a context-free grammar, definition of a context-free language
1:09:00 Closing
Have a beautiful day!
Supporters (to date of publication, by tier (top to bottom)):
----------------------------------------------------------
Patreon Supporters (General Support):
Draikou
Patreon Supporters (Basic Support):
Eric R
Patreon Supporters (Supporter Access!):
-----------------------------------------------------------
Become a supporter today! To support my work and mission to provide free or accessible Computer Science education (especially in theory), subscribe to the channel, share my videos. Please donate and contribute to support my work for more content:
PATREON: https://www.patreon.com/PageWizard
SUBSCRIBESTAR: https://www.subscribestar.com/drpage
PAYPAL: https://paypal.me/pagewizard
Follow also at:
FACEBOOK: https://www.facebook.com/DanielRPage
TWITTER: https://twitter.com/PageWizardGLE
QUORA: https://www.quora.com/profile/Daniel-R-Page
TWITCH: https://www.twitch.tv/pagewizard
#ComputerScience
#grammars
#theoryofcomputation