|
⇤ ← Revision 1 as of 2005-08-31 23:53:44
Size: 295
Comment:
|
Size: 478
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 5: | Line 5: |
| A context free grammar consists of a set of rewritting rules or productions of the form | A context-free grammar is a 4-tuple [[latex2($(V,\Sigma,R,S)$)]], where |
| Line 7: | Line 7: |
{{{ symbol --> symbol symbol... }}} |
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 |
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
- 1.V is a finite set called the variables,
- 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