[Overview] [Previous] [Next]

Definition of CFGs

Important! A grammar G = (V, T, S, P) is a context free grammar (cfg) if all productions in P have the form
A goes to x
where Recall that the general form of a production is
A goes to B
where Since V is a proper subset of (V union T)plus, the productions for a context-free grammar are a restricted form of the productions allowed for a general grammar. Thus, a context-free grammar is a grammar.

Copyright 1996 by David Matuszek
Last modified Feb 26, 1996