LANGUAGE IMPLEMENTATION FOR PUSH DOWN AUTOMATA (PDA)
Keywords:
Natural Language, Formal Language, Automata, Finite Automata, Theory Of Computing, Grammars, Strings, Push-Down Automata, Noam Chomsky, TuringAbstract
The theory of computer science began with the questions of “How and What” And formal language theory was initiated by the question, “How are languages defined?” Linguist Noam Chomsky developed formal systems called grammars that defined natural language for generating syntactically correct sentences that included in the language. Computer scientists were grappling with the problem of explicitly and unambiguously defining the syntax of programming languages. This research paper will review the definition of automata, context free grammar for some strings that belong to particular languages and their implementations in programming languages such as Java.
References
Thomas A. Sudkamp, “Languages and Machines: An Introduction to the Theory of Computer Science”, 2e, Addition-Wesley, Reading Massachusetts, 1997, pages: 1, 2
John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, “Introduction to Automata Theory, Languages, and Computation”, 3e, Addison-Wesley, 2007, pages: 1 - 4
Dr. M.M. Alam, Associate Professor Electronic Government Research Center (EGRC) COMSATS, Institute of Information Technology Islamabad, pages: 11 - 14
D. Goeswami, K.V. Krishna, “Formal Languages and Automata Theory”, Nov. 5, 2010, pages: 18 - 23
S. P. Eugene Xavier, “Theory of Automata, Formal Languages and Computation”, New Age International Publisher, New Delhi, 2005, pages: 159 - 162
Javier Esparza, “Automata Theory: An algorithm approach”, Lecture notes, July 20, 2012, Pages: 9-10
