Exercise 2:

Non-ambiguous CFG for {ancbnn>0}\{ a^n c b^n \mid n>0 \}
Write a non-ambiguous CFG generating the words over {a,b,c}\{a,b,c\} such that there is an occurrence of cc exactly at the middle, to its left there are only aa’s (and there is at least one aa), and to its right there are only bb’s (and there is at least one bb). Note that, since the only occurrence of cc must be exactly at the middle, the number of aa’s must be equal to the number of bb’s.
Authors: Guillem Godoy / Documentation:
To be able to submit you need to either log in, register, or become a guest.