Exercise 11:

Non-ambiguous CFG for {aibjckj=i+k}\{ a^i b^j c^k \mid j=i+k \}
Write a non-ambiguous CFG generating the words of the form aibjcka^i b^j c^k such that the number of bb’s coincides with the number of aa’s plus the number of cc’s.
Authors: Guillem Godoy / Documentation:
To be able to submit you need to either log in, register, or become a guest.