Converting Context Free Grammar to Chomsky Normal Form -- 2

Completed Posted 4 years ago Paid on delivery
Completed Paid on delivery

Steps to Convert CFG to CNF

1. Eliminate lambda productions

2. Eliminate Unit productions

3. Eliminate non-terminating and unreachable productions

Should have knowledge of automata theory. Context Free Grammar. Chomsky Normal Form

step 2 and 3 have been done in the attached code. What is need is to do step 1.

The attached code has comments, please build on top of it.

Deadline: 24 hours.

Algorithm C++ Programming Programming Software Architecture Software Development

Project ID: #22402160

About the project

1 proposal Remote project Active 4 years ago

Awarded to:

BeshoyMousaKhair

hi , it's an easy task for me and i can do it in time as required , thanks in advance .

$60 USD in 7 days
(36 Reviews)
4.5