Context Free Grammars

Computer Science Level pending

What does the following context-free grammar describe?

S is the start symbol and the set of nonterminal symbols is \(\{0,1\}\). Here are the production rules:

S --> 0

S --> 0S

S --> 1S

×

Problem Loading...

Note Loading...

Set Loading...