What are Grammars (in Theory of Computation)?

Here we look at a "grammar", which is a way of formally generating strings. We saw with DFA/NFAs that they can recognize whether a string is in the language, and a regular expression describes a language. The grammar has a set of rules that one can apply from the "start variable", to hopefully get a string entirely of terminals. Easy Theory Website: https://www.easytheory.org GoFundMe: https://www.gofundme.com/f/easy-theory-video-studio Patreon: https://www.patreon.com/EasyTheoryYT Fourthwall: https://easy-theory-llc-shop.fourthwall.com Problem Solving channel: ​⁠ @easytheoryprobsolve If you like this content, please consider subscribing to my channel: https://www.youtube.com/channel/UC3VY6RTXegnoSD_q446oBdg?sub_confirmation=1