The Gateway to Computer Science Excellence
0 votes
4 views

Design grammars for the following languages:

  1. The set of all strings of $0's$ and $1's$ such that every $0$ is immediately followed by at least one $1$.
  2. The set of all strings of $0's$ and $1's$ that are palindromes; that is, the string reads the same backward as forward.
  3. The set of all strings of $0's$ and $1's$ with an equal number of $0's$ and $1's$.
  4. The set of all strings of $0's$ and $1's$ with an unequal number of $0's$ and $1's$.
  5. The set of all strings of $0's$ and $1's$ in which $011$ does not appear as a substring.
  6.  The set of all strings of $0's$ and $1's$ of the form $xy$, where $x\neq y$ and $x$ and $y$ are of the same length. 
in Compiler Design by Veteran (54.7k points) | 4 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,648 questions
56,455 answers
195,309 comments
100,135 users