ContextFree Grammars
Context-free grammars are formal systems used to generate strings in a formal language. They consist of a set of production rules that define how symbols in the language can be combined to form valid strings. These production rules are typically of the form A -> α, where A is a non-terminal symbol and α is a string of terminals and/or non-terminals. Context-free grammars are commonly used in computer science and linguistics to describe the syntax of programming languages and natural languages.