A Tool for Visualization of Parsers: JFLAP

Thu Zar Khaing


In recent years, tools for computer aided gaining knowledge of have come to be great on all degrees of education. Those equipment are used as options or additions to traditional methods of teaching, so as to wastage of student time to absorb the taught course. Then again, these tools are very plenty useful to the students people who are having the burden of course teachers while getting ready complicated examples when you consider that those can be created and accomplished in real time and then analyzed in elegance. To advantage knowledge other than the normal methods, we have developed JFLAP tool, a device for studying primary concepts of Formal Languages and Automata principle. The main goal of the JFLAP tool is to create Type 0 languages, Type 1 languages, Type 2 languages, Type 4 languages, Parsers and visually present complex concepts and mathematical models of Automata Theory fundamentals. In this paper, we suggest, JFLAP converts user defined i.e. Context free Grammar to SLR (easy LR) parsing table and presents it to the user in a form of state diagram, Parsing table and Derivation table.


JFLAP, Context-Free Grammars, LR Parsers and Computer aided learning, Context-Free language.

Full Text:



Ivan Budiselic, Sinisa Srbljic and Miroslav Popovic, “RegExpert: A Tool for Visualization of Regular Expressions”, The IEEE International Conference on “Computer as a Tool”, EUROCON 2007.

S. Srbljic, Compiler Design 1: Introduction to Theory of Formal Languages, Automata, and Grammars, (original title in Croatian: Jezicni procesori 1: uvod u teoriju formalnih jezika, automata igramatika”), 2nd Edition, Element, Zagreb, 2002, pp. 46-50.

S. Wolfram, The Mathematica Book, 5th Edition, Wolfram Media, 2003.

Pemmaraju and S. Skiena, Computational DiscreteMathematics: Combinatorics and Graph Theory with Mathematica, Cambridge University Press, 2003.

B. aneva and D. Thiébaut, “Sorting algorithms,” Smith College, htp://maven.smith.edu/~thiebaut/java/sort/demo.html.

A. Jacobsen, “Data-link network protocol simulation,” University of Birmingham, School of Computer Science, http://www.cs.bham.ac.uk/~gkt/Teaching/SEM335/dlsim/Simulation.html.

B. W. Watson, “The design and implementation of the FIRE engine: a C++ toolkit for finite automata and regular expressions,” Computing Science Note 94/22, Eindhoven University of Technology, Netherlands, 1994.

Grail+ Project homepage, http://www.csd.uwo.ca/Research/grail/index.html.

S. H. Rodger and T. W. Finley, JFLAP: An Interactive Formal Languages and Automata Package, Jones & Bartlett Publishers, Sudbury, MA, 2006.

Skuliber, S. Srbljic, and I. Crkvenac, “Using interactivity in computer-facilitated learning for efficient comprehension of mathematical abstractions,” Proceedings of the EUROCON 2001, International Conference on Trends in Communication, Bratislava, Slovak Republic, July, 2001, vol. 2/2, pp. 278-281.

Skuliber, S. Srbljic, and A. Milanovic, “Extending the textbook: a distributed tool for learning automata theory fundamentals,” Proceedings of the 9th IEEE International Conference on Electronics, Circuits and Systems (ICECS 2002), Dubrovnik, Croatia, September, 2002.


  • There are currently no refbacks.

Copyright (c) 2020 Thu Zar Khaing

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.