Skip to content

Home
Tutorials
- C++
- DBMS
- OOP
- OS
- SE
- Theory Of Automata
- Software Testing
- Data Mining
- Data Structures
- Distributed Database
- HTML
- CSS
- Javascript
- PHP
- Projects
- Jobs Test
Research
Papers
MCQs
Contact

How to convert a Regular Expression into CFG?

25Let’s see some Examples of Regular Expression to Context Free GRAMMAR Conversion.

Regular Expression	Context Free GRAMMAR
0*	S → 0S S → ε
(a+b)*	S → aS \| bS S → ε
(ab)*	X –> YX X –> ε Y –> ab

Related Posts:

Single inheritance C++ program to to convert a convert a convert decimal number into binary
C++ Program to convert a positive number into a negative number and negative number into a positive number
Classes Objects C++ program to to convert a convert decimal number into binary
Write a C++ Program to convert centimeter into meter and kilometer using if-else statement
Program in C++ to convert a decimal number into binary
Convert hours into minutes and seconds program in C++ (C Plus Plus).

Theory of automata

Theory Of Automata
MCQS
Past Papers(Guess)
Alphabets, Strings, Words & basics
Descriptive definition
Recursive definition
Regular Expression
- Exercise on Regular Expression – 100+ Examples
What is meaning of Epsilon or Null?
Finite Automata
- Exercise on Finite Automata – 100+ Examples
What is a dead state?
FA to RE Conversion
Transition Table
NFA
Push Down Automata – PDA
Turing Machine TM
- Exercise on Turing Machine 30+Examples
TM – Regular languages
List of important Turing Machines in Automata
Recursively enumerable languages
Context Free Grammer CFG
- Exercise on Context Free Grammer CFG
Regular Expression conversion to CFG
Chomsky normal Form and Examples
Algebraic Laws for Regular Expressions RegEx
RegExp of strings Contains at least three 1s
Video Lectures
MCQs
Computer Science Research Topics for MS PhD

Search for:

Contents Copyrights reserved by T4Tutorials