Reference no: EM132373929
Implement ONE application with two modules (Parts)
Part 1
Program that can convert NFA into RG and can check whether any given string is accepted by the NFA.
NOTE: NFAs can be entered in form of graphics (preferable), transition table.
Example1 : by transition table

Example2 : NFA in form of graphics (preferable),

Part 2
Write a program that can do the following:
Phase 1) converts context-free grammar into Chomsky normal form (CNF).
a) Input: Context-free grammar,
b) Output: Grammar in Chomsky normal form (CNF) (show the steps)
Phase 2) generates the CYK based on the CNF grammar that was produced in Phase (1)
Input: String to be parsed
a. Output: The program should show the following output
a) Display of the CYK chart (Table)
b) A statement to inform user whether the string can/cannot be generated by the grammar
Final App must look like the example below : ONE application with home screen and other modules (Parts) . pop-ups screens and messages are not allowed
Documents must include:
1. Cover page
2. Members and their participation percentages
3. Introduction
4. Design Flowcharts , DFA, NFA
5. 4 screenshots
6. Manual with examples
7. Important codes
Attachment:- Theory of Computation.rar