RGPV 2020 Write given CFG for R.E (011 + 1)*(01)*. Ans. CFG for (011 + 1)* A –> CA A –> ε C –> 011 | a CFG for (01)* B –> DB B –> ε D –> 01 Final CFG for (011 + 1)*(01)* S –> AB A –> CA | ε C –> […]

### Category: Regular Expression

## Regular expression to Regular grammar

RGPV 2020 How can we construct regular grammar from regular expression? Ans. Lets take an regular expresion example: 0*(1(0+1))* Now convert above example in to regular language. 0*(1(0+1))* Conver above regular expression into Right linear regular grammar in step by step. Step 01: S –> 0S Step 02: S –> 0S | A | ∈ […]

## What is Regular Expression

Q. What is Regular Expression ? Ans. The language accepted by finite automata can be easily described by simple expressions called Regular Expressions. Let, Σ denote input set. 1. Φ is a regular expression which denotes the empty set. 2. ε is a regular expression and denotes the set {ε} and it is a null string. […]