Data type Modeling with DFA and NFA as a Lexical Analysis Generator


  • Nisreen L. Abdulnabi Department of Economics and Administration, Duhok University, Duhok, Kurdistan Region – Iraq
  • Hawar B. Ahmad Department of Computer Science, Nawroz University, Duhok, Kurdistan Region – Iraq



Lexical analysis helps the interactivity and visualization for active learning that can improve difficult concepts in automata. This study gives an implementation of two frequently used model, NFA for combination of Real and Integer data type and DFA for Double Data Type in Java this chosen model will be implemented using JFLAP. The model will also be tested using JFLAP that will accept at least FIVE (5) inputs and rejected FIVE (5) inputs. These two models are some of the different lexical analyzer generators that have been implemented for different purposes in finite automata.


Download data is not yet available.


C.-P. Chou, K.-F. Jea and H.-H. Liao, "A syntactic approach to twig-query matching on XML streams," The Journal of Systems and Software, vol. 84, p. 993–1007, 2011.
H. Luo, "Research of Using Finite Automaton in the Modeling of Lexical Analyzer," in International Conference on Information Management, Innovation Management and Industrial Engineering, 2012.
S. Loglo, Sarula and HuaShabao, "Research on Mongolian Lexical Analyzer Based on NF A," in IEEE, 2010.
Z. Gejun, S. Yuqiang, Y. Ruimin and G. Yuwan, "A Simplification Algorithm of Regular Grammar Production," in International Conference on Information Science and Engineering, 2009.
Bhowmik, A. Kumar, A. K. Jha and R. Kumar Agrawal, "A New Approach of Complier Design in Context of Lexical Analyzer and Parser Generation for NextGen Languages," International Journal of Computer Applications, vol. 6, no. 11, pp. 21-25, 2010.
Mateescu, A. Salomaa, K. Salomaa and S. Yu, "Lexical Analysis with a Simple Finite-Fuzzy-Automaton Model," Journal of Universal Computer Science, vol. 1, no. 5, pp. 292-311, 1995.
William M. Waite, Assad Jarrahian, Michele H. Jackson, Amer Diwan, 2006. Design and Implementation of a Modern Compiler Course, ACM 1595930558/06/0006.
Braune, S. Diehl, A. Kerren, and R. Wilhelm.Animation of the generation and computation of finite automata for learning software. In Proc. 4th Intl. Workshop Implementing Automata, LNCS 2214, pp. 39–47. Springer, 2001.
R. Cavalcante, T. Finley, and S. H. Rodger. A visual and interactive automata theory course with JFLAP 4.0. In Proc. SIGCSE’04, pp. 140–144. ACM Press, 2004.
S. Diehl, A. Kerren, and T. Weller. Visual exploration of generation algorithms for finite automata on the web. In Proc. 5th Intl. Conf. Implementation and Application of Automata, LNCS 2088, pp. 327–328. Springer, 2000.
J. Saraiva. HaLeX: A Haskell Library to Model, Manipulate and Animate Regular Languages. In Proc. ACM Workshop on Functional and Declarative Programming in Education, pp. 133–140. University of Kiel Technical Report 0210, 2002.
T. M. White and T. P. Way. jFAST: A Java finite automata simulator. In Proc. SIGCSE’06, pp. 384–388. ACM Press, 2006.



How to Cite

Abdulnabi, N. L., & Ahmad, H. B. (2019). Data type Modeling with DFA and NFA as a Lexical Analysis Generator. Academic Journal of Nawroz University, 8(4), 415–420.