Definition of Context-Free Grammar includes the definition of Context free language. So please read the following definition carefully.
Just as any formal grammar, a context-free grammar G can be defined as a 4-tuple:
G = (Vt,Vn,P,S) where
Vt is a finite set of terminals
Vn is a finite set of non-terminals
P is a finite set of production rules
S is an element of Vn, the distinguished starting non-terminal.
elements of P are of the form
Vn(Vt U Vn)*
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment