Context-free Grammars

• S is a finite set of terminals
• N is a finite set of non-terminals
• P is a finite subset of production rules
• S is the start symbol

G=(S ,N,P,S)

Previous slide

Next slide

Back to first slide

View graphic version