Simplication of Context Free Grammar And Testing for Membership

Abstract

A software is developed to aid the students on understanding some of the theories in Automata and Language Theory course. Specifically, this Special Problem is developed to demonstrate simplification of Context Free grammars and testing for membership of a given string/word satisfying the grammar rules. This also shows the strings that can be generated by a finite type of grammar. Helpful information regarding the basic concepts and steps being taken are provided while executing the simulation of simplifying Context Free Grammars and a testing a string if it can be generated by the inserted grammar.