Size: 478
Comment:
|
Size: 634
Comment:
|
Deletions are marked like this. | Additions are marked like this. |
Line 7: | Line 7: |
1.V is a finite set called the variables, 2. is a finite set, disjoint from V, called the terminals, 3.R is a finite set of rules, with each rule being a variable and a string of variables and terminals, and 4.S∈V is the start variable |
1. Element 1. Element 1. Element 1. Element An example of a rule is |
Context Free Grammar
Def: For every ContextFreeLanguage there is a ContextFreeGrammar that generates it and a PushDownAutomata that recognizes it.
A context-free grammar is a 4-tuple latex2($(V,\Sigma,R,S)$), where
- Element
$ is a finite set called the variables, Element
is a finite set, disjoint from latex2($V$), called the terminals,- Element
is a finite set of rules, with each rule being a variable and a string of variables and terminals, and - Element
is the start variable
An example of a rule is