Simple Java application that convert Context Free Grammar to Chomsky Normal Form with the knowledge of Theory Of Computation.
Context-Free Grammars (CFG), is a powerful method of describing context free languages that possess recursive structure, which makes them useful in a variety of applications. A language is context free if and only if pushdown automaton (PDA) recognizes it. Many useful languages are context-free, including most programming languages, query languages, and markup languages.
However, CFG can be ambiguous or sometimes unambigious generates from the same language. A grammar is called inherently ambiguous if there is no equivalent umambiguous grammar to generates it. When working with context-free grammars CFG, it is often convenient to have them in simplified form. One of the simplest and most useful forms is called the Chomsky normal form.
This application attempt to receive CFG as input and transformed into CNF grammar expressing as same language, all the procedure and steps are shown in the program.
- Clone the sourcecode with Git:
$ git clone https://github.com/CodesAreHonest/convert-CFG-to-CNF.git- Go to the cloned repository and change directory to the containing JAR files under out/artifacts/theory_of_computation_jar/.
$ cd out/artifacts/theory_of_computation_jar- Run the JAR file.
$ java -jar theory-of-computation.jar
- Linux Ubuntu 16.04.03 LTS 64-bit
- IntelliJ IDEA Ultimate
- Java 1.8.0_151 SE Runtime Environment
- Run the application according to the steps mentioned above, pressed the button to proceed.
- Insert the Context-Free Grammar at the textbox, the arrow must be -> and cannot be other symbols.
- Press the Convert button and the output will be display.
Remark: The application is not fault tolerance, if the input is wrong error message will be displayed and it requires user to relaunch the application again.
- Chai Ying Hua
This project had stop maintaining and delivered as coursework to Multimedia University. Any improvement or pull request is welcomed.