Question: EXERCISES Show that S a S | b S | c A A a A | b S | | is an s - grammar.

EXERCISES
Show that
SaS|bS|cA
AaA|bS||
is an s-grammar.
2. Show that every s-grammar is unambiguous.
3. Find an s-grammar for L(aaa**b+ab**).
4. Find an s-grammar for L={anbn:n2}.
5. Find an s-grammar for L={anb2n:n2}.
6. Find an s-grammar for L={anbn+1:n1}.
7. Let G=(V,T,S,P) be an s-grammar. Give an expression for the maximum size of P in terms of |V| and |T|.
8. Show that the following grammar is ambiguous:
SAB|aaaB,||
Aa|Aa||
Bb.
solve3,4,6,8
EXERCISES Show that S a S | b S | c A A a A | b S

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!