Context-Free Languages

Probably going to deprecate this in favour of merging with PDAs

A grammar is a 4-tuple: $(V,\Sigma ,R,S)$ where:

• $V$ is the variables
• $\Sigma$ is the terminal symbols
• $R$ is a set of rules (production????)
  • Must be finite
• $S$ is the start variable

$S$

Since Context-Free Grammars came from Chomsky, $S$ may stand for Sentence (check if this is true?)