Simulation of Push Down Automaton, Conversion of Context Free Grammar to Push Down Automaton and Vice Versa

Abstract

The study of Automata and Language Theory is fundamental in the study of Computer Science. Two of its topics involve the analysis of pushdown automata and context free languages, which are difficult and tedious. A software is developed to simulate the processes involved in a pushdown automaton. It shows how the stack is manipulated in testing user inputs. A visualization of the conversion of a pushdown automaton to a context free grammar, as well as a context free grammar to an equivalent pushdown automaton are also provided.