Question

1. Design a context-free grammar that generates the language: L = \{a$^i$b$^j$c$^k$ | i $\neq$ j or j $\neq$ k\} that is, the set of a's followed by b's followed by c's, such that there are either a different number if a's and b's or a different number of b's and c's, or both. (15 points)

          1. Design a context-free grammar that generates the language:
L = \{a$^i$b$^j$c$^k$ | i $\neq$ j or j $\neq$ k\}
that is, the set of a's followed by b's followed by c's, such that there are
either a different number if a's and b's or a different number of b's and c's,
or both. (15 points)

$1. Design a context-free grammar that generates the language: L = {a^ib^jc^k | i ≠ j or j ≠ k} that is, the set of a's followed by b's followed by c's, such that there are either a different number if a's and b's or a different number of b's and c's, or both. (15 points)$

Added by Joshua M.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Ali Karimiafshar

Step 1

First, we need to generate a sequence of a's followed by b's followed by c's. We can do this by creating a non-terminal symbol S that represents this sequence. S -> aSbc | ε This production rule generates a sequence of a's followed by b's followed by c's. The ε Show more…

Show all steps

Thanks for your feedback!

Design a context-free grammar that generates the language: L = {abcIijorj#k} that is, the set of a's followed by b's followed by c's, such that there are either a different number of a's and b's or a different number of b's and c's or both. (15 points)