A Survey about various Generations of Lexical Analyzer

  • Authors

    • Zakiya Ali Nayef Computer Science
    2019-12-15
    https://doi.org/10.14419/jacst.v8i2.29881
  • Finite Automata, Regular Expression, Lexer, DFA, NFA, PDA and Turning Machines.

  • Abstract

    Lexical analysis helps the interactivity and visualization for active learning that can improve difficult concepts in automata. This study gives a view on different lexical analyzer generators that has been implemented for different purposes in finite automata. It also intends to give a general idea on the lexical analyzer process, which will cover the automata model that is used in the various reviews. Some concepts that will be described are finite automata model, regular expression and other related components. Also, the advantages and disadvantages of lexical analyzer will be discussed.

     

  • References

    1. [1] 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. https://doi.org/10.1016/j.jss.2011.01.033.

      [2] 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. https://doi.org/10.1109/ICIII.2012.6339811.

      [3] S. Loglo, Sarula and HuaShabao, "Research on Mongolian Lexical Analyzer Based on NF A," in IEEE, 2010. https://doi.org/10.1109/ICICISYS.2010.5658760.

      [4] 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.

      [5] T. Kos, T. Kosar, J. Knez and M. Mernik, "Improving End-User Productivity in Measurement Systems with a Domain-Specific (Modeling) Language Sequencer," in CEUR Workshop Proceedings, 2010.

      [6] B. 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. https://doi.org/10.5120/1116-1462.

      [7] A. 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. https://doi.org/10.1007/978-3-642-80350-5_28.

      [8] G. Dodig Crnkovic and M. Burgin, "Unconventional Algorithms: Complementarity of Axiomatics and Construction," Entropy, vol. 14, pp. 2066-2080, 2012. https://doi.org/10.3390/e14112066.

      [9] HE Yan-xiang, WU Chun-xiang, WANG Han-fei. Compile Principle [M]. Beijing Machinery Industry Press, 20 10.

      [10] Alfred V.Aho, Ravi Sethi, Jeffery D. Ullman, Addison- Wesley, 2007. Compilers- Principles, Techniques, and Tools.

      [11] Torben Ægidius Mogensen, May 28, 2009. Basics of Compiler Designâ€, lulu, Extended Edition.

      [12] William M. Waite, Assad Jarrahian, Michele H. Jackson, Amer Diwan, 2006. Design and Implementation of a Modern Compiler Course, ACM 1595930558/06/0006. https://doi.org/10.1145/1140124.1140132.

      [13] B. 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. https://doi.org/10.1007/3-540-45526-4_4.

      [14] 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. https://doi.org/10.1145/971300.971349.

      [15] 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. https://doi.org/10.1007/3-540-44674-5_29.

      [16] 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.

      [17] T. M. White and T. P. Way. jFAST: A Java finite automata simulator. In Proc. SIGCSE’06, pp. 384–388. ACM Press, 2006. https://doi.org/10.1145/1121341.1121460.

  • Downloads

  • How to Cite

    Ali Nayef, Z. (2019). A Survey about various Generations of Lexical Analyzer. Journal of Advanced Computer Science & Technology (JACST), 8(2), 50-57. https://doi.org/10.14419/jacst.v8i2.29881

    Received date: 2019-09-17

    Accepted date: 2019-10-24

    Published date: 2019-12-15